Abundance: Asymmetric Graph Removal Lemmas and Integer Solutions to Linear Equations

We prove that a large family of pairs of graphs satisfy a polynomial dependence in asymmetric graph removal lemmas. In particular, we give an unexpected answer to a question of Gishboliner, Shapira, and Wigderson by showing that for every $t \geqslant 4$, there are $K_t$-abundant graphs of chromatic...

Full description

Saved in:
Bibliographic Details
Main Authors Girão, António, Hurley, Eoin, Illingworth, Freddie, Michel, Lukas
Format Journal Article
LanguageEnglish
Published 27.10.2023
Subjects
Online AccessGet full text

Cover

Loading…