On the chromatic number of triangle-free graphs of large minimum degree

DOI10.1007/s00493-002-0009-5zbMath1026.05042OpenAlexW2007516388WikidataQ56926729 ScholiaQ56926729MaRDI QIDQ1410410

Carsten Thomassen

Publication date: 14 October 2003

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: http://orbit.dtu.dk/en/publications/on-the-chromatic-number-of-trianglefree-graphs-of-large-minimum-degree(9ca2a673-9ab6-437b-8536-d928e619224b).html

zbMATH Keywords

chromatic numbertriangle-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (22)

Dense graphs with small clique number ⋮ Hypergraphs with zero chromatic threshold ⋮ Triangle-free subgraphs of random graphs ⋮ On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs ⋮ On the Structure of Graphs with Given Odd Girth and Large Minimum Degree ⋮ The chromatic profile of locally bipartite graphs ⋮ Andrásfai and Vega graphs in Ramsey–Turán theory ⋮ A note on independent sets in graphs with large minimum degree and small cliques ⋮ Minimum degree and the graph removal lemma ⋮ The critical number of dense triangle-free binary matroids ⋮ Kernelization for cycle transversal problems ⋮ The minimum degree removal lemma thresholds ⋮ On the Chromatic Thresholds of Hypergraphs ⋮ Critical graphs without triangles: an optimum density construction ⋮ On the chromatic number of \(H\)-free graphs of large minimum degree ⋮ Independence, odd girth, and average degree ⋮ Triangle-Free Subgraphs of Random Graphs ⋮ Dense binary \(\mathrm{PG}(t-1,2)\)-free matroids have critical number \(t-1\) or \(t\) ⋮ A note on generalized pentagons ⋮ New kernels for several problems on planar graphs ⋮ On the structure of Dense graphs with bounded clique number ⋮ Homomorphism thresholds for odd cycles

This page was built for publication: On the chromatic number of triangle-free graphs of large minimum degree