20 citations · 71 across the 33 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
math.CO2009
Dense H-free graphs are almost (χ(H)-1)-partite
Peter Allen
By using the Szemerédi Regularity Lemma, Alon and Sudakov recently extended the classical Andrásfai-Erdõs-Sós theorem to cover general graphs. We prove, without using the Regularit…
math.CO2009★ 5 cited
Filling the gap between Turán's theorem and Pósa's conjecture
Peter Allen, Julia Böttcher, Jan Hladký
Much of extremal graph theory has concentrated either on finding very small subgraphs of a large graph (Turan-type results) or on finding spanning subgraphs (Dirac-type results). I…