Szemerédi Regularity Lemma
22,99 €
inkl. MwSt.

Versandfertig in 6-10 Tagen
  • Broschiertes Buch

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics, Szemerédi''s regularity lemma states that every large enough graph can be divided into subsets of about the same size so that the edges between different subsets behave almost randomly. Szemerédi (1975) introduced a weaker version of this lemma, restricted to bipartite graphs, in order to prove Szemerédi''s theorem, and in (Szemerédi 1978) he proved the full lemma. There are several extension of the regularity lemma to hypergraphs, such as Tao (2006).

Andere Kunden interessierten sich auch für
Produktbeschreibung
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics, Szemerédi''s regularity lemma states that every large enough graph can be divided into subsets of about the same size so that the edges between different subsets behave almost randomly. Szemerédi (1975) introduced a weaker version of this lemma, restricted to bipartite graphs, in order to prove Szemerédi''s theorem, and in (Szemerédi 1978) he proved the full lemma. There are several extension of the regularity lemma to hypergraphs, such as Tao (2006).