\(H\)-free graphs of large minimum degree

zbMath1085.05036MaRDI QIDQ819178

Benjamin Sudakov, Noga Alon

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

zbMATH Keywords

chromatic number

Mathematics Subject Classification ID

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

Related Items (7)

Dense graphs with small clique number ⋮ On a conjecture of Erdős and Simonovits: even cycles ⋮ \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups ⋮ On the KŁR conjecture in random graphs ⋮ On the chromatic number of \(H\)-free graphs of large minimum degree ⋮ Hardness of edge-modification problems ⋮ Stability‐type results for hereditary properties

This page was built for publication: \(H\)-free graphs of large minimum degree