Compartir
A Hyper Graph Regularity Method for Linear Hypergraphs (en Inglés)
Shoaib Khan; Brendan Nagle (Autor)
·
Lap Lambert Academic Publishing
· Tapa Blanda
A Hyper Graph Regularity Method for Linear Hypergraphs (en Inglés) - Shoaib Khan; Brendan Nagle
$ 44.57
$ 52.92
Ahorras: $ 8.35
Elige la lista en la que quieres agregar tu producto o crea una nueva lista
✓ Producto agregado correctamente a la lista de deseos.
Ir a Mis ListasSe enviará desde nuestra bodega entre el
Miércoles 12 de Junio y el
Jueves 13 de Junio.
Lo recibirás en cualquier lugar de Estados Unidos entre 1 y 3 días hábiles luego del envío.
Reseña del libro "A Hyper Graph Regularity Method for Linear Hypergraphs (en Inglés)"
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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
Todos los libros de nuestro catálogo son Originales.
El libro está escrito en Inglés.
La encuadernación de esta edición es Tapa Blanda.
✓ Producto agregado correctamente al carro, Ir a Pagar.
