Efficient Removal Lemmas for Matrices

Noga Alon, Omri Ben‐Eliezer

Type: Article

Publication Date: 2019-05-23

Citations: 4

DOI: https://doi.org/10.1007/s11083-019-09494-3

View Publication

Download PDF

Locations

Order - View
arXiv (Cornell University) - View - PDF
Leibniz-Zentrum für Informatik (Schloss Dagstuhl) - View - PDF

Similar Works

Action	Title	Year	Authors
+	Efficient Removal Lemmas for Matrices	2016	Noga Alon Omri Ben‐Eliezer
+	Efficient Removal Lemmas for Matrices	2016	Noga Alon Omri Ben‐Eliezer
+	Removal Lemmas for Matrices.	2016	Noga Alon Omri Ben‐Eliezer
+	Multi-symbol forbidden configurations	2019	Keaton Ellis Baian Liu Attila Sali
+ PDF Chat	Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs	2007	Ilan Alon Eldar Fischer Ilan Newman
+	Füredi-Hajnal limits are typically subexponential.	2016	Josef Cibulka Jan Kynčl
+	Testing Pattern-Freeness.	2016	Simon Korman Daniel Reichman
+	A Survey of Forbidden Configuration Results	2013	R.P. Anstee
+	Better upper bounds on the Füredi-Hajnal limits of permutations	2016	Josef Cibulka Jan Kynčl
+	The Removal Lemma for Tournaments	2017	Jacob Fox Lior Gishboliner A. Shapira Raphael Yuster
+	Better upper bounds on the Füredi-Hajnal limits of permutations	2017	Josef Cibulka Jan Kynčl
+	Lower Bounds for Matrix Factorization	2019	Mrinal Kumar Ben Lee Volk
+	Lower Bounds for Matrix Factorization	2019	Mrinal Kumar Ben Lee Volk
+	Better upper bounds on the füredi-hajnal limits of permutations	2017	Josef Cibulka Jan Kynčl
+	The Removal Lemma for Tournaments	2017	Jacob Fox Lior Gishboliner A. Shapira Raphael Yuster
+	Testing hereditary properties of ordered graphs and matrices.	2017	Noga Alon Omri Ben‐Eliezer Eldar Fischer
+ PDF Chat	The removal lemma for tournaments	2018	Jacob Fox Lior Gishboliner A. Shapira Raphael Yuster
+	Testing hereditary properties of ordered graphs and matrices	2017	Noga Alon Omri Ben‐Eliezer Eldar Fischer
+	Testing hereditary properties of ordered graphs and matrices	2017	Noga Alon Omri Ben‐Eliezer Eldar Fischer
+ PDF Chat	Sampling Permutations Satisfying Constraints within and beyond the Local Lemma Regime	2024	Kun He Guoliang Qiu Xiaoming Sun

Works That Cite This (4)

Action	Title	Year	Authors
+ PDF Chat	Polynomial removal lemmas for ordered graphs	2022	Lior Gishboliner István Tomon
+	A removal lemma for ordered hypergraphs	2024	Henry Towsner
+	Abundance: Asymmetric graph removal lemmas and integer solutions to linear equations	2024	António Girão Eoin Hurley Freddie Illingworth Lukas Michel
+ PDF Chat	Testing Hereditary Properties of Ordered Graphs and Matrices	2017	Noga Alon Omri Ben‐Eliezer Eldar Fischer

Works Cited by This (17)

Action	Title	Year	Authors
+ PDF Chat	Regularity Partitions and The Topology of Graphons	2010	László Lovász Balázs Szegedy
+ PDF Chat	Bounds for graph regularity and removal lemmas	2012	David Conlon Jacob Fox
+ PDF Chat	Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs	2007	Ilan Alon Eldar Fischer Ilan Newman
+	Regularity Lemma for k‐uniform hypergraphs	2004	Vojtěch Rödl Jozef Skokan
+	On Sets of Integers Which Contain No Three Terms in Arithmetical Progression	1946	Felix Behrend
+	A variant of the hypergraph removal lemma	2006	Terence Tao
+ PDF Chat	The Algorithmic Aspects of the Regularity Lemma	1994	Noga Alon Richard A. Duke Hanno Lefmann V. Rödl Raphael Yuster
+	The counting lemma for regular k-uniform hypergraphs	2006	Brendan Nagle Vojtěch Rödl Mathias Schacht
+ PDF Chat	A Characterization of Easily Testable Induced Subgraphs	2006	Noga Alon A. Shapira
+ PDF Chat	A new proof of the graph removal lemma	2011	Jacob Fox