1. Dense H-free graphs are almost (χ(H)−1)-partite;Allen;Electron. J. Combin.,2010
2. P. Allen, J. Böttcher, S. Griffiths, Y. Kohayakawa, R. Morris, Chromatic thresholds in random graphs (in preparation).
3. On the connection between chromatic number, maximal clique and minimal degree of a graph;Andrásfai;Discrete Math.,1974
4. J. Balogh, J. Butterfield, P. Hu, J. Lenz, D. Mubayi, On the chromatic thresholds of hypergraphs, arXiv:1103.1416 (submitted for publication).
5. Modern Graph Theory;Bollobás,1998