Graph removal lemmas
From MaRDI portal
Publication:2875854
DOI10.1017/CBO9781139506748.002zbMath1301.05309arXiv1211.3487OpenAlexW2963005178MaRDI QIDQ2875854
Publication date: 12 August 2014
Published in: Surveys in Combinatorics 2013 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.3487
Related Items (47)
Testing graphs against an unknown distribution ⋮ Polynomial removal lemmas for ordered graphs ⋮ The spectral radius of graphs with no intersecting odd cycles ⋮ Induced arithmetic removal: complexity 1 patterns over finite fields ⋮ Fast Property Testing and Metrics for Permutations ⋮ On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs ⋮ A spectral condition for the existence of the square of a path ⋮ The maximum spectral radius of wheel-free graphs ⋮ On the local structure of oriented graphs -- a case study in flag algebras ⋮ Efficient Removal Lemmas for Matrices ⋮ Efficient removal lemmas for matrices ⋮ Testing Linear-Invariant Properties ⋮ Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ The removal lemma for tournaments ⋮ Making an H $H$‐free graph k $k$‐colorable ⋮ Minimum degree and the graph removal lemma ⋮ A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing ⋮ Ramsey non-goodness involving books ⋮ The Bradley-Terry condition is \(L_1\)-testable ⋮ Unnamed Item ⋮ Triangles in graphs without bipartite suspensions ⋮ The maximum spectral radius of graphs without friendship subgraphs ⋮ Sparse Hypergraphs with Applications to Coding Theory ⋮ Sparse hypergraphs: new bounds and constructions ⋮ Turán and Ramsey numbers in linear triple systems ⋮ A counterexample to sparse removal ⋮ Efficient Testing without Efficient Regularity ⋮ \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups ⋮ On the KŁR conjecture in random graphs ⋮ Some intriguing upper bounds for separating hash families ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ The joints problem for matroids ⋮ A sparse regular approximation lemma ⋮ A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity ⋮ Comparable pairs in families of sets ⋮ The signless Laplacian spectral radius of graphs with no intersecting triangles ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems ⋮ Removal and Stability for Erdös--Ko--Rado ⋮ Minimizing the number of 5-cycles in graphs with given edge-density ⋮ The Induced Removal Lemma in Sparse Graphs ⋮ Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits ⋮ Erdös--Pósa Property for Labeled Minors: 2-Connected Minors ⋮ Estimating parameters associated with monotone properties ⋮ New Results on Linear Size Distance Preservers ⋮ A new bound for the Brown-Erdős-Sós problem ⋮ A Ramsey variant of the Brown–Erdős–Sós conjecture ⋮ The regularity method for graphs with few 4‐cycles
This page was built for publication: Graph removal lemmas
