A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal lemma

Terence Tao

Type: Preprint

Publication Date: 2006-01-01

Citations: 6

DOI: https://doi.org/10.48550/arxiv.math/0602037

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View
arXiv (Cornell University) - View
DataCite API - View
arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	A Simple Regularization of Hypergraphs	2006	Yoshiyasu Ishigami
+	Szemerédi's regularity lemma revisited	2005	Terence Tao
+	A variant of the hypergraph removal lemma	2006	Terence Tao
+ PDF	None	2020	Noam Lifshitz
+	The regularity Lemma in additive combinatorics	2007	Lluís Vena
+	Szemer'edi's regularity lemma revisited	2006	Terence Tao
+	Removal lemmas in sparse graphs	2015	Ander Lamaison Vidarte
+	Algorithmic theory of random graphs	1997	FriezeAlan McDiarmidColin
+	A short noninductive proof of the containers theorem for hypergraphs	2018	Anton Bernshteyn Michelle Delcourt Henry Towsner Anush Tserunyan
+ PDF	A Quantitative Ergodic Theory Proof of Szemerédi's Theorem	2006	Terence Tao
+	Information theory, relative versions of the hypergraph regularity and removal lemmas, the Szemer\'edi-Furstenberg-Katznelson theorem, and prime constellations in number fields	2005	Terence Tao
+	Deviation probabilities for arithmetic progressions and other regular discrete structures	2019	Gonzalo Fiz Pontiveros Simon Griffiths Matheus Secco Oriol Serra
+	Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems	2018	Noam Lifshitz
+	A short nonalgorithmic proof of the containers theorem for hypergraphs	2018	Anton Bernshteyn Michelle Delcourt Henry Towsner Anush Tserunyan
+	A short nonalgorithmic proof of the containers theorem for hypergraphs	2018	Anton Bernshteyn Michelle Delcourt Henry Towsner Anush Tserunyan
+	An Analytic Approach to Sparse Hypergraphs: Hypergraph Removal	2012	Henry Towsner
+	An Analytic Approach to Sparse Hypergraphs: Hypergraph Removal	2012	Henry Towsner
+	A short nonalgorithmic proof of the containers theorem for hypergraphs	2018	Anton Bernshteyn Michelle Delcourt Henry Towsner Anush Tserunyan
+	Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems	2018	Noam Lifshitz
+	Deviation probabilities for arithmetic progressions and irregular discrete structures	2020	Simon Griffiths Christoph Koch Matheus Secco

Works That Cite This (6)

Action	Title	Year	Authors
+ PDF Chat	Structure and Randomness in Combinatorics	2007	Terence Tao
+ PDF Chat	The ergodic and combinatorial approaches to Szemerédi’s theorem	2007	Terence Tao
+ PDF Chat	Structure and Randomness in Combinatorics	2007	Terence Tao
+	A General Correspondence between Averages and Integrals	2008	Henry Towsner
+	Connections between probability estimation and graph theory	2009	Narayana Santhanam
+	Norm convergence of multiple ergodic averages for commuting transformations	2007	Terence Tao

Works Cited by This (17)

Action	Title	Year	Authors
+ PDF	On sets of integers containing k elements in arithmetic progression	1975	Endre Szemerédi
+	Recurrence in Ergodic Theory and Combinatorial Number Theory	1981	Harry Furstenberg
+	Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions	1977	Harry Furstenberg
+	Szemer'edi's regularity lemma revisited	2006	Terence Tao
+	Applications of the regularity lemma for uniform hypergraphs	2006	Vojtěch Rödl Jozef Skokan
+ PDF	A Quantitative Ergodic Theory Proof of Szemerédi's Theorem	2006	Terence Tao
+	Density theorems and extremal hypergraph problems	2006	V. Rödl Eduardo Tengan Mathias Schacht Norihide Tokushige
+	On Certain Sets of Positive Density	1959	P. Varnavides
+	Quasi‐random hypergraphs	1990	Fan Chung R. L. Graham
+	REGULAR PARTITIONS OF GRAPHS	1975	Endre Szemerédi