Tiling Turán theorems (Q1586364)

Given a graph \(H\), \(\text{TT}(n,H,M)\) is the least minimum degree of an \(n\)-vertex graph \(G\) which ensures that vertex disjoint copies of \(H\) can be embedded in a large graph \(G\), having in all \(M\) vertices. The author proves a formula for the limit over \(n\) of \(\frac{1}{n} \text{TT}(n,H,xn)\) in terms of \(x\), which involves only the chromatic number and a refinement, the critical chromatic number.