Regularity inheritance in pseudorandom graphs
Combinatorics
2019-02-08 v2
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 -counting lemmas for subgraphs of bijumbled graphs, for some .
Keywords
Cite
@article{arxiv.1606.01168,
title = {Regularity inheritance in pseudorandom graphs},
author = {Peter Allen and Julia Böttcher and Jozef Skokan and Maya Stein},
journal= {arXiv preprint arXiv:1606.01168},
year = {2019}
}
Comments
28 pages, no figures