Regularity inheritance in pseudorandom graphs

Artículo
Thumbnail
Open/Download
IconRegularity inheritance in.pdf (731.0Kb)
Access note
Acceso Abierto
Publication date
2020
Metadata
Show full item record
Cómo citar
Cómo citar
Regularity inheritance in pseudorandom graphs
.
Copiar
Cerrar

Author
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.
Indexation
Artículo de publicación ISI
Identifier
URI:
DOI: 10.1002/rsa.20851
ISSN: 1042-9832
Quote Item
Random Struct Alg. 2020;56:306–338.
Collections

The following license files are associated with this item:

Attribution-NonCommercial-NoDerivs 3.0 Chile
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Chile