A Simple Regularization of Hypergraphs

Yoshiyasu Ishigami

Type: Preprint

Publication Date: 2006-01-01

Citations: 25

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

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	A simple regularization of graphs	2009	Yoshiyasu Ishigami
+	A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal lemma	2006	Terence Tao
+	Hypergraph regularity and quasi-randomness	2009	Brendan Nagle Annika Poerschket Vojtěch Rödl Mathias Schacht
+	Szemerédi's regularity lemma revisited	2005	Terence Tao
+	Hypergraphs, Quasi-randomness, and Conditions for Regularity	2002	Yoshiharu Kohayakawa Vojtěch Rödl Jozef Skokan
+ PDF Chat	None	2020	Noam Lifshitz
+	A variant of the hypergraph removal lemma	2006	Terence Tao
+	Hypergraph regularity and quasi-randomness	2009	Brendan Nagle Annika Poerschke Vojtěch Rödl Mathias Schacht
+	Szemer'edi's regularity lemma revisited	2006	Terence Tao
+	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
+	A Tight Bound for Hypergraph Regularity II	2018	Guy Moshkovitz A. Shapira
+	Regularity lemmas for hypergraphs and quasi‐randomness	1991	Fan Chung
+	Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems	2018	Noam Lifshitz
+	Deviation probabilities for arithmetic progressions and other regular discrete structures	2019	Gonzalo Fiz Pontiveros Simon Griffiths Matheus Secco Oriol Serra
+	Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs	2006	W. T. Gowers
+	Quasi-random hypergraphs	2018
+	A short nonalgorithmic proof of the containers theorem for hypergraphs	2018	Anton Bernshteyn Michelle Delcourt Henry Towsner Anush Tserunyan
+	Extremal Hypergraph Theory and Algorithmic Regularity Lemma for Sparse Graphs	2010	Rerum Naturalium Mathematisch-Naturwissenschaftlichen Fakultät
+	Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems	2018	Noam Lifshitz

Works That Cite This (24)

Action	Title	Year	Authors
+	A measure-theoretic approach to the theory of dense hypergraphs	2012	Gábor Elek Balázs Szegedy
+ PDF Chat	Green's conjecture and testing linear-invariant properties	2009	A. Shapira
+	Removal lemma for infinitely-many forbidden hypergraphs and property testing	2006	Yoshiyasu Ishigami
+	On the testability and repair of hereditary hypergraph properties	2008	Tim Austin Terence Tao
+	Linear Ramsey Numbers for Bounded-Degree Hypergrahps	2007	Yoshiyasu Ishigami
+	A simple regularization of graphs	2009	Yoshiyasu Ishigami
+	On the removal lemma for linear configurations in finite abelian groups	2015	Lluís Vena
+	The Removal Lemma: algebraic versions and applications	2012	Lluís Vena
+ PDF Chat	The quasi‐randomness of hypergraph cut properties	2011	A. Shapira Raphael Yuster
+ PDF Chat	A proof of Green's conjecture regarding the removal properties of sets of linear equations	2010	A. Shapira

Works Cited by This (47)

Action	Title	Year	Authors
+	Graph limits and testing hereditary graph properties	2005	László Lovász Balázs Szegedy
+	Note on a Generalization of Roth’s Theorem	2003	József Solymosi
+	Integer sets containing no arithmetic progressions	1990	Endre Szemerédi
+	Removal lemma for infinitely-many forbidden hypergraphs and property testing	2006	Yoshiyasu Ishigami
+	The Regularity Lemma and Its Applications in Graph Theory	2002	János Komlós Ali Shokoufandeh Miklós Simonovits Endre Szemerédi
+	Efficient testing of large graphs	2003	Noga Alon Michael Krivelevich E. Fischer Márió Szegedy
+	Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions	1977	Harry Furstenberg
+	Regularity Lemma for k‐uniform hypergraphs	2004	Vojtěch Rödl Jozef Skokan
+	Quasi‐random classes of hypergraphs	1990	Fan Chung
+	On Triples in Arithmetic Progression	1999	Jean Bourgain