Dense \(H\)-free graphs are almost \((\chi (H)-1)\)-partite
From MaRDI portal
Publication:2380453
zbMath1215.05090arXiv0907.3815MaRDI QIDQ2380453
Publication date: 26 March 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.3815
Related Items (5)
Turán numbers of bipartite graphs plus an odd cycle ⋮ A counting lemma for binary matroids and applications to extremal problems ⋮ On a conjecture of Erdős and Simonovits: even cycles ⋮ On the KŁR conjecture in random graphs ⋮ On the chromatic number of \(H\)-free graphs of large minimum degree
This page was built for publication: Dense \(H\)-free graphs are almost \((\chi (H)-1)\)-partite
