High Quality Content by WIKIPEDIA articles! In mathematics, Szemeredi'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. Szemeredi (1975) introduced a weaker version of this lemma, restricted to bipartite graphs, in order to prove Szemeredi's theorem, and in (Szemeredi 1978) he proved the full lemma. There are several extension of the regularity lemma to hypergraphs, such as Tao (2006).

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.