Idioma:

Regularity inheritance in pseudorandom graphs

Allen, Peter ; Böttcher, Julia ; Skokan, Jozef ; Stein, Maya

Random structures & algorithms, 2020-03, Vol.56 (2), p.306-338 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
Regularity inheritance in pseudorandom graphs
Autor: Allen, Peter ; Böttcher, Julia ; Skokan, Jozef ; Stein, Maya
Assuntos: counting lemma ; Graph theory ; Graphs ; Inheritances ; Pseudorandom ; pseudorandom graphs ; Regularity ; regularity inheritance ; sparse regularity lemma ; Szemerédi's regularity lemma
É parte de: Random structures & algorithms, 2020-03, Vol.56 (2), p.306-338
Descrição: 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.
Editor: New York: John Wiley & Sons, Inc
Idioma: Inglês

Voltar para lista de resultados