szemeredi's regularity lemma 123 浏览 0关注

In mathematics, the Szemerédi regularity lemma states that every large enough graph (mathematics)|graph can be divided into subsets of about the same size so that the edges between different subsets behave almost randomly. introduced a weaker version of this lemma, restricted to bipartite graphs, in order to prove Szemerédi's theorem, and in he proved the full lemma. Extensions of the regularity method to hypergraph|hypergraphs were obtained by Vojtěch Rödl|Rödl and his collaborators and Timothy Gowers|Gowers.
 相关概念
 主要的会议/期刊 SIAMCOM... RSA ENDM Electr.... CPC COMBINA... STOC ISIT