We consider the structure of H-free subgraphs of graphs with high minimal degree. We prove that for every k>m there exists an ϵ≔ϵ(k,m)>0 so that the following holds. For every graph H with chromatic number k from which one can delete an edge and reduce the chromatic number, and for every graph G on n>n0(H) vertices in which all degrees are at least (1−ϵ)n, any subgraph of G which is H-free and contains the maximum number of copies of the complete graph Km is (k−1)-colorable. We also consider several extensions for the case of a general forbidden graph H of a given chromatic number, and for subgraphs maximizing the number of copies of balanced blowups of complete graphs.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Chromatic number
- Dense graphs
- Turan type problems