Kaikki kirjat 25 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

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

englanti
2011-09-19
52,90 € 70,53 €

-25% koodilla BOOKS

Toimittajalla varastossa

Toimitus 15-21 arkipäivässä

30 päivän palautusoikeus

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äydellinen kuvaus

Saatat myös pitää

Kuvaus

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.

Lisätietoja

Kirjoittaja Shoaib Khan, Brendan Nagle
Julkaisija LAP LAMBERT Academic Publishing
Julkaisuvuosi 2011
Kannen tyyppi Pehmeäkantinen
EAN 9783844388398
Kirjoita oma arvostelusi
Arvostelet: A Hyper graph Regularity Method for Linear Hypergraphs: With Applications
Arvostelusi:

Goodreads-arvostelut

52,90 € 70,53 €