arrow
返回

The hypergraph regularity method and its applications

delete2005-05-26
delete26
delete
OA
AI
R
Rödl, V
B
Brendan Nagle
J
Jozef Skokan
M
Mathias Schacht
Y
Yoshiharu Kohayakawa
DOI:10.1073/pnas.0502771102delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Szemeredi's regularity lemma asserts that every graph can be decomposed into relatively few random-like subgraphs. This random-like behavior enables one to find and enumerate subgraphs of a given isomorphism type, yielding the so-called counting lemma for graphs. The combined application of these two lemmas is known as the regularity method for graphs and has proved useful in graph theory, combinatorial geometry, combinatorial number theory, and theoretical computer science. Here, we report on recent advances in the regularity method for k-uniform hypergraphs, for arbitrary k >= 2. This method, purely combinatorial in nature, gives alternative proofs of density theorems originally due to E. Szemeredi, H. Furstenberg, and Y. Katznelson. Further results in extremal combinatorics also have been obtained with this approach. The two main components of the regularity method for k-uniform hypergraphs, the regularity lemma and the counting lemma, have been obtained recently: Rodl and Skokan (based on earlier work of Frankl and Rodl) generalized Szemeredi's regularity lemma to k-uniform hypergraphs, and Nagle, Rodl, and Schacht succeeded in proving a counting lemma accompanying the Rodl-Skokan hypergraph regularity lemma. The counting lemma is proved by reducing the counting problem to a simpler one previously investigated by Kohayakawa, Rodl, and Skokan. Similar results were obtained independently by W. T. Gowers, following a different approach.
Keyword:
Szemeredi's theorem
regularity lemma
counting lemma
removal lemma
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

P
Proceedings of the National Academy of Sciences of the United States of America
IF:
9.1
论文数:
10.8W
被引数:
73.5W

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
err分享
err收藏
Preprocessing Requirements Documents for Automatic UML Modelling
err2022-06-13
err0
PREAI
errMartijn B. J. Schouten; Guus J. Ramackers; Suzan Verberne
err分享
err收藏
err分享
err收藏
A machine learning approach to software model refactoring
err2020-01-08
err0
PREAI
errBrahmaleen Kaur Sidhu; Kawaljeet Singh; Neeraj Sharma
err分享
err收藏
Enhanced photoluminescence and directional white-light generation by plasmonic array
err2018-12-05
err0
errOAAI
errRyosuke Kamakura; Shunsuke Murai; Yusuke Yokobayashi; Keijiro Takashima; Masaru Kuramoto; Koji Fujita; Katsuhisa Tanaka
err分享
err收藏
学者 查看更多内容