Regularity inheritance in pseudorandom graphs

Abstract

Advancing the sparse regularity method, we prove one-sided and two-sided regularity inheritance lemmas for subgraphs of bijumbled graphs, improving on results of Conlon, Fox and Zhao [Adv. Math. 256 (2014), 206--290]. These inheritance lemmas also imply improved $H$-counting lemmas for subgraphs of bijumbled graphs, for some $H$.

28 pages, no figures

References in corpus (1)

• On the KŁR conjecture in random graphs

Cited by in corpus (2)

• Regularity inheritance in hypergraphs
• Odd cycles in subgraphs of sparse pseudorandom graphs