Regularity inheritance in pseudorandom graphs
Open Access
- 29 April 2019
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 56 (2) , 306-338
Abstract
No abstract availableKeywords
Funding Information
- EPSRC (EP/P032125/1, EP/R00532X/1)
- National Science Foundation (DMS‐1500121)
This publication has 21 references indexed in Scilit:
- Szemerédi's Regularity Lemma for Matrices and Sparse GraphsCombinatorics, Probability and Computing, 2011
- Embedding large subgraphs into dense graphs2009
- Local resilience of graphsRandom Structures & Algorithms, 2008
- Proof of the bandwidth conjecture of Bollobás and KomlósMathematische Annalen, 2008
- Turán's theorem for pseudo-random graphsJournal of Combinatorial Theory, Series A, 2007
- Small subsets inherit sparse ε-regularityJournal of Combinatorial Theory, Series B, 2007
- The sparse regularity lemma and its applications2005
- OnK 4-free subgraphs of random graphsCombinatorica, 1997
- Cutting a graph into two dissimilar halvesJournal of Graph Theory, 1988
- Imbalances in k‐colorationsNetworks, 1971