| Full text | |
| Author(s): |
Total Authors: 4
|
| Affiliation: | [1] Univ Rhode Isl, Dept Math, 5 Lippitt Rd, Kingston, RI 02881 - USA
[2] Univ Sao Paulo, Inst Matemat & Estat, Rua Matao 1010, BR-05508090 Sao Paulo - Brazil
[3] Free Univ Berlin, Inst Math, Arnimallee 3, D-14195 Berlin - Germany
[4] Berlin Math Sch, Berlin - Germany
[5] Tech Univ Ilmenau, Inst Math, D-98684 Ilmenau - Germany
Total Affiliations: 5
|
| Document type: | Journal article |
| Source: | EUROPEAN JOURNAL OF COMBINATORICS; v. 82, DEC 2019. |
| Web of Science Citations: | 0 |
| Abstract | |
We prove that for any t >= 3 there exist constants c > 0 and n(0) such that any d-regular n-vertex graph G with t vertical bar n >= n(0) and second largest eigenvalue in absolute value lambda satisfying lambda <= cd(t)/n(t-1) contains a K-t-factor, that is, vertex-disjoint copies of K-t covering every vertex of G. The result generalizes to broader setting of jumbled graphs, which were introduced by Thomason in the eighties. (C) 2019 Elsevier Ltd. All rights reserved. (AU) | |
| FAPESP's process: | 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science |
| Grantee: | Carlos Eduardo Ferreira |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 14/18641-5 - Hamilton cycles and tiling problems in hypergraphs |
| Grantee: | Jie Han |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |