The chromatic thresholds of graphs

DOI10.1016/j.aim.2012.11.016zbMath1263.05048arXiv1108.1746WikidataQ105583580 ScholiaQ105583580MaRDI QIDQ1941151

Yanyan Li

Publication date: 11 March 2013

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.1746

zbMATH Keywords

graph colouring; minimum degree; chromatic threshold

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C15: Coloring of graphs and hypergraphs

Related Items

Triangle-Free Subgraphs of Random Graphs, On the structure of Dense graphs with bounded clique number, Regular Tur\'an numbers, On the Chromatic Thresholds of Hypergraphs, The chromatic profile of locally colourable graphs, Andrásfai and Vega graphs in Ramsey–Turán theory, Minimum degree and the graph removal lemma, The minimum degree removal lemma thresholds, On the KŁR conjecture in random graphs, Homomorphism thresholds for odd cycles, The critical number of dense triangle-free binary matroids, Cycles with consecutive odd lengths, Dense binary \(\mathrm{PG}(t-1,2)\)-free matroids have critical number \(t-1\) or \(t\), A counting lemma for binary matroids and applications to extremal problems, On a conjecture of Erdős and Simonovits: even cycles, Hypergraphs with zero chromatic threshold, The chromatic profile of locally bipartite graphs