H-free graphs of large minimum degree

MaRDI QIDQ819178zbMATH OpenFDO

Authors Noga Alon, Benny Sudakov

Publication date 22 March 2006

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/125852, http://www.emis.de/journals/EJC/Volume_13/Abstracts/v13i1r19.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

chromatic number

Mathematics Subject Classification ID

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

Recommendations

• Dense \(H\)-free graphs are almost \((\chi (H)-1)\)-partite
• On the chromatic number of \(H\)-free graphs of large minimum degree
• On the structure of triangle-free graphs of large minimum degree
• On the chromatic number of triangle-free graphs of large minimum degree
• The chromatic thresholds of graphs

Cited in

(17)

• H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
• Hardness of edge-modification problems
• On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite
• The chromatic profile of locally colourable graphs
• On a conjecture of Erdős and Simonovits: even cycles
• Stability-type results for hereditary properties
• Counting \(H\)-free graphs
• Dense graphs with small clique number
• Dense \(H\)-free graphs are almost \((\chi (H)-1)\)-partite
• Minimum degree stability of \(H\)-free graphs
• Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
• On Switching to H-Free Graphs
• On the KŁR conjecture in random graphs
• Large P₄‐free graphs with bounded degree
• On the chromatic number of \(H\)-free graphs of large minimum degree
• On Switching to H‐Free Graphs
• The chromatic thresholds of graphs

This page was built for publication: \(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 Q819178)