On embedding well-separable graphs (Q941369)

This paper is about guaranteeing that a given graph \(H\) is a subgraph of an arbitrary graph \(G\). The author considers graphs \(H\) that are ``far from being an expander'', namely \(H\) is well-separable if there is a subset \(S \subset V(H)\) of size \(o(n)\) such that all components of \(H-S\) are of size \(o(n)\). Let \(\Delta\) denote the maximum degree of \(H\) and \(\chi\) its chromatic number. The author shows that if \(H\) is well-seperable, then for every \(\Delta\) and \(\gamma > 0\) there exists an \(n_0\) such that if \(G\) is of order \(n \geq n_0\) and minimum degree \(\delta(G) \geq (1 - 1/(2(\chi -1)) + \gamma)n\), one gets \(H \subset G\). This work can be considered as a generalization of Turán's Theorem, as well of a generalization of work by Erdös-Stone-Simonovits.