On the structure of triangle-free graphs of large minimum degree

DOI10.1007/s00493-006-0028-8zbMath1112.05055OpenAlexW2049127787MaRDI QIDQ858147

Tomasz Łuczak

Publication date: 8 January 2007

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-006-0028-8

zbMATH Keywords

extremal problems

Mathematics Subject Classification ID

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

Related Items (14)

Dense graphs with small clique number ⋮ Hypergraphs with zero chromatic threshold ⋮ On the Ramsey-Turán density of triangles ⋮ The Ramsey-Turán problem for cliques ⋮ 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 minimum degree removal lemma thresholds ⋮ On the Chromatic Thresholds of Hypergraphs ⋮ On the chromatic number of \(H\)-free graphs of large minimum degree ⋮ On the structure of Dense graphs with bounded clique number ⋮ Homomorphism thresholds for odd cycles

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