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

DOI10.1007/S00373-010-0994-XzbMATH Open1234.05096OpenAlexW2017921399WikidataQ105583468 ScholiaQ105583468MaRDI QIDQ659735FDOQ659735

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)

Cites Work

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

Cited In (4)

• The minimum degree removal lemma thresholds
• On the chromatic number of pentagon-free graphs of large minimum degree
• Triangle-Free Subgraphs of Random Graphs
• Homomorphism thresholds for odd cycles

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)