2018/06/05 by Han, Jie, Kohayakawa, Yoshiharu, Morris, Patrick +1
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1806.01676
We prove that for any t≥ 3 there exist constants c>0 and n0 such that any d-regular n-vertex graph G with t| n≥ n0 and second largest eigenvalue in absolute value λ satisfying λ≤ c dt/nt-1 contains a Kt-factor, that is, vertex-disjoint copies of Kt covering every vertex of G.