\(H\)-free graphs of large minimum degree (Q819178): Difference between revisions

Summary: We prove the following extension of an old result of \textit{B. Andrásfai, P. Erdős} and \textit{V. Sós} [Discrete Math. 8, 205--218 (1974; Zbl 0284.05106)]. For every fixed graph \(H\) with chromatic number \(r+1 \geq 3\), and for every fixed \(\varepsilon>0\), there are \(n_0=n_0(H,\varepsilon)\) and \(\rho=\rho(H) >0\), such that the following holds. Let \(G\) be an \(H\)-free graph on \(n>n_0\) vertices with minimum degree at least \((1-{1\over r-1/3}+\varepsilon)n\). Then one can delete at most \(n^{2-\rho}\) edges to make \(G\) \(r\)-colorable.