$H$-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups
Preprint
Abstract
We consider the structure of $H$-free subgraphs of graphs with high minimal degree. We prove that for every $k>m$ there exists an $\epsilon:=\epsilon(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>n_0(H)$ vertices in which all degrees are at least $(1-\epsilon)n$, any subgraph of $G$ which is $H$-free and contains the maximum number of copies of the complete graph $K_m$ 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.
Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Many T copies in H-free graphsJournal of Combinatorial Theory, Series B, 2016
- Graph removal lemmas2013
- On the number of pentagons in triangle-free graphsJournal of Combinatorial Theory, Series A, 2013
- On the maximum number of five-cycles in a triangle-free graphJournal of Combinatorial Theory, Series B, 2012
- On the minimal degree implying equality of the largest triangle-free and bipartite subgraphsJournal of Combinatorial Theory, Series B, 2006
- Density Conditions For Triangles In Multipartite GraphsCombinatorica, 2006
- Efficient Testing of Large GraphsCombinatorica, 2000
- On the connection between chromatic number, maximal clique and minimal degree of a graphDiscrete Mathematics, 1974
- On a valence problem in extremal graph theoryDiscrete Mathematics, 1973
- On extremal problems of graphs and generalized graphsIsrael Journal of Mathematics, 1964