Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

A Hyper graph Regularity Method for Linear Hypergraphs: With Applications - Shoaib Khan,Brendan Nagle

inglise keel
2011-09-19
49,37 € 70,53 €

-30% koodiga BOOKS

Meie tarnija laos

Saadetis 15-21 tööpäeva jooksul

30-päevane tagastamisõigus

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 a ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Autor Shoaib Khan, Brendan Nagle
Kirjastaja LAP LAMBERT Academic Publishing
Väljalaskeaasta 2011
Kaanetüüp Pehme kaanega
EAN 9783844388398
Kirjuta oma arvustus
Te vaatate: A Hyper graph Regularity Method for Linear Hypergraphs: With Applications
Teie hinnang:

Goodreads'i arvustused

49,37 € 70,53 €