Abstract

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 λ≤cdt∕nt−1 contains a Kt-factor, that is, vertex-disjoint copies of Kt covering every vertex of G. The result generalizes to broader setting of jumbled graphs, which were introduced by Thomason in the eighties.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.