szemeredi's regularity lemma
118
浏览
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.
主要的会议/期刊
演化趋势
Chart will load here
szemeredi's regularity lemma文章数量变化趋势

Feedback
Feedback
Feedback
我想反馈:
排行榜