Near-perfect clique-factors in sparse pseudorandom graphs
Near-perfect clique-factors in sparse pseudorandom graphs
Abstract We prove that, for any $t \ge 3$ , there exists a constant c = c ( t ) > 0 such that any d -regular n -vertex graph with the second largest eigenvalue in absolute value λ satisfying $\lambda \le c{d^{t - 1}}/{n^{t - 2}}$ contains vertex-disjoint copies …