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. These inheritance lemmas also imply improved H-counting lemmas for subgraphs of bijumbled graphs, for some H.
Más información
| Título según WOS: | Regularity inheritance in pseudorandom graphs |
| Título según SCOPUS: | Regularity inheritance in pseudorandom graphs |
| Título de la Revista: | RANDOM STRUCTURES & ALGORITHMS |
| Volumen: | 56 |
| Número: | 2 |
| Editorial: | Wiley |
| Fecha de publicación: | 2020 |
| Página de inicio: | 306 |
| Página final: | 338 |
| Idioma: | English |
| DOI: |
10.1002/rsa.20851 |
| Notas: | ISI, SCOPUS |