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

DOI10.1007/S00493-006-0028-8zbMATH Open1112.05055OpenAlexW2049127787MaRDI QIDQ858147FDOQ858147

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

Recommendations

• On the chromatic number of triangle-free graphs of large minimum degree
• Triangle-Free Graphs with High Minimal Degrees
• A 4-colour problem for dense triangle-free graphs
• On the Structure of Dense Triangle-Free Graphs
• Triangle-Free Graphs with Large Degree

zbMATH Keywords

extremal problems

Mathematics Subject Classification ID

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

Cited In (28)

• On the Chromatic Thresholds of Hypergraphs
• The extremal functions for triangle-free graphs with excluded minors
• A note on independent sets in graphs with large minimum degree and small cliques
• On the Ramsey-Turán density of triangles
• Hypergraphs with zero chromatic threshold
• Upper bounds for the regularity of gap-free graphs in terms of minimal triangulation
• Andrásfai and Vega graphs in Ramsey–Turán theory
• The minimum semidefinite rank of a triangle-free graph
• The chromatic profile of locally colourable graphs
• Triangle-free circuit decompositions and Petersen minor
• Triangle-Free Graphs with High Minimal Degrees
• A 4-colour problem for dense triangle-free graphs
• Minimum degree and the graph removal lemma
• Dense graphs with small clique number
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dense \(H\)-free graphs are almost \((\chi (H)-1)\)-partite
• Triangle-Free Graphs with Large Degree
• The minimum degree removal lemma thresholds
• On the Structure of Graphs with Given Odd Girth and Large Minimum Degree
• The chromatic profile of locally bipartite graphs
• \(H\)-free graphs of large minimum degree
• On the chromatic number of triangle-free graphs of large minimum degree
• Homomorphism thresholds for odd cycles
• On the structure of Dense graphs with bounded clique number
• On the chromatic number of \(H\)-free graphs of large minimum degree
• Title not available (Why is that?)
• The Ramsey-Turán problem for cliques

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858147)