Small subsets inherit sparse -regularity
DOI10.1016/J.JCTB.2006.03.004zbMATH Open1111.05090OpenAlexW2030380672WikidataQ105583648 ScholiaQ105583648MaRDI QIDQ858679FDOQ858679
Authors: Stefanie Gerke, Yoshiharu Kohayakawa, Vojtěch Rödl, Angelika Steger 
Publication date: 11 January 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2006.03.004
Recommendations
quasi-randomness\(C_{\ell}\)-free graphsmall witness to high chromatic numbersparse regularity lemma
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On universality of graphs with uniformly distributed edges
- Arithmetic progressions of length three in subsets of a random set
- An extremal problem for random graphs and the number of graphs with large even-girth
- Turán's extremal problem in random graphs: Forbidding even cycles
- On \(K^ 4\)-free subgraphs of random graphs
- A probabilistic counting Lemma for complete graphs
- Szemerédi’s Regularity Lemma for Sparse Graphs
- On graphs with small subgraphs of large chromatic number
- Large triangle-free subgraphs in graphs without \(K_ 4\)
- Random Ramsey graphs for the four-cycle
- Turán's extremal problem in random graphs: Forbidding odd cycles
- \(K_4\)-free subgraphs of random graphs revisited
- Turán's theorem in sparse random graphs
- K5‐free subgraphs of random graphs
- The Turn Theorem for Random Graphs
- On triangle-free random graphs
- The sparse regularity lemma and its applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regular pairs in sparse random graphs I
- Title not available (Why is that?)
Cited In (32)
- The size‐Ramsey number of cubic graphs
- Asymmetric Ramsey properties of random graphs involving cliques
- Random directed graphs are robustly Hamiltonian
- Almost spanning subgraphs of random graphs after adversarial edge removal
- On the number of orientations of random graphs with no directed cycles of a given length
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Independent sets in hypergraphs
- Sparse partition universal graphs for graphs of bounded degree
- Combinatorial theorems in sparse random sets
- \(K_4\)-free subgraphs of random graphs revisited
- Covering cycles in sparse graphs
- Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
- The size‐Ramsey number of short subdivisions
- Tilings in graphons
- Holes in graphs
- Local resilience for squares of almost spanning cycles in sparse random graphs
- A characterization for sparse \(\varepsilon\)-regular pairs
- The size Ramsey number of short subdivisions of bounded degree graphs
- Regular pairs in sparse random graphs I
- A new proof of the KŁR conjecture
- On the size-Ramsey number of grids
- A note on counting orientations
- A spanning bandwidth theorem in random graphs
- Extremal results in sparse pseudorandom graphs
- On the size-Ramsey number of grid graphs
- Regularity inheritance in pseudorandom graphs
- On the KŁR conjecture in random graphs
- Threshold behavior of multi-path random key pre-distribution for sparse wireless sensor networks
- Sparse multipartite graphs as partition universal for graphs with bounded degree
- Small \(\dot{B}^{-1}_{\infty,\infty}\) implies regularity
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
- On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles
This page was built for publication: Small subsets inherit sparse \(\varepsilon\)-regularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858679)
