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

DOI10.1007/S00373-010-0994-XMaRDI QIDQ659735zbMATH OpenOpenAlexWikidataFDO

Authors Jeremy Lyle

Publication date 24 January 2012

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-010-0994-x

zbMATH Keywords

\(H\)-Free graphsMinimum degree conditions

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the chromatic number of triangle-free graphs of large minimum degree
• H-free graphs of large minimum degree
• The chromatic thresholds of graphs
• On the chromatic number of pentagon-free graphs of large minimum degree
• On the structure of triangle-free graphs of large minimum degree

Cites work

• H-free graphs of large minimum degree
• Dense \(H\)-free graphs are almost \((\chi (H)-1)\)-partite
• Dense graphs with small clique number
• Graph Theory and Probability
• scientific article; zbMATH DE number 2123255 (Why is no real title available?)
• scientific article; zbMATH DE number 878896 (Why is no real title available?)
• Kneser's conjecture, chromatic number, and homotopy
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• On a valence problem in extremal graph theory
• On the chromatic number of pentagon-free graphs of large minimum degree
• On the chromatic number of triangle-free graphs of large minimum degree
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• On the structure of linear graphs
• On the structure of triangle-free graphs of large minimum degree
• Subtrees and subforests of graphs

Cited in

(8)

• On the chromatic number of triangle-free graphs of large minimum degree
• On the chromatic number of pentagon-free graphs of large minimum degree
• Triangle-free subgraphs of random graphs
• When removing an independent set is optimal for reducing the chromatic number
• The minimum degree removal lemma thresholds
• The minimum degree removal lemma thresholds (extended abstract)
• Homomorphism thresholds for odd cycles
• H-free graphs of large minimum degree

This page was built for publication: On the chromatic number of \(H\)-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 Q659735)