JavaScript parece estar deshabilitado en tu navegador. Para la mejor experiencia en nuestro sitio, asegúrate de activar JavaScript en tu navegador.

SKU/Artículo: AMZ-3844388397

A Hyper graph Regularity Method for Linear Hypergraphs: With Applications

Detalles del producto

Disponibilidad:
En stock

Peso con empaque:
0.36 kg

Devolución:
Sí

Condición
Nuevo

Producto de:
Amazon

Viaja desde
USA

Sobre este producto

Szemerédi's Regularity Lemma is a powerful tool in Graph Theory, yielding many applications in areas such as Extremal Graph Theory, Combinatorial Number Theory and Theoretical Computer Science. Strong hypergraph extensions of graph regularity techniques were recently given by Nagle, Rődl, Schacht and Skokan, by W.T. Gowers, and subsequently, by T. Tao. These extensions have yielded quite a few non-trivial applications to Extremal Hypergraph Theory, Combinatorial Number Theory and Theoretical Computer Science. A main drawback to the hypergraph regularity techniques above is that they are highly technical. In this thesis, we consider a less technical version of hypergraph regularity which more directly generalizes Szemerédi's regularity lemma for graphs. The tools we discuss won't yield all applications of their stronger relatives, but yield still several applications in extremal hypergraph theory (for so-called linear or simple hypergraphs), including algorithmic ones. This thesis surveys these lighter regularity techiques, and develops three applications of them.

U$S 147,40

55% OFF

U$S 67,00

NO CONSUME FRANQUICIA

Si tu carrito tiene solo libros o CD’s, no consume franquicia y podés comprar hasta U$S 1000 al año.

U$S 147,40

55% OFF

U$S 67,00

Llega en 5 a 11 días hábiles

con envío

Tienes garantía de entrega

Medios de pago

Cantidad

Medios de pago

Aceptamos múltiples medios de pago para tu comodidad

Tarjetas prepagas, débito y crédito