| Full text | |
| Author(s): |
Gao, Wei
;
Han, Jie
Total Authors: 2
|
| Document type: | Journal article |
| Source: | COMBINATORICS PROBABILITY & COMPUTING; v. 26, n. 4, p. 536-559, JUL 2017. |
| Web of Science Citations: | 3 |
| Abstract | |
Let C-6(3) be the 3-uniform hypergraph on [1,...,6] with edges 123,345, 561, which can be seen as the analogue of the triangle in 3-uniform hypergraphs. For sufficiently large n divisible by 6, we show that every n-vertex 3-uniform hypergraph H with minimum codegree at least n/3 contains a C-6(3)-factor, that is, a spanning subhypergraph consisting of vertex-disjoint copies of C-6(3). The minimum codegree condition is best possible. This improves the asymptotic result obtained by Mycroft and answers a question of Rodl and Rucinski exactly. (AU) | |
| FAPESP's process: | 14/18641-5 - Hamilton cycles and tiling problems in hypergraphs |
| Grantee: | Jie Han |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 15/07869-8 - Perfect matchings and Tilings in hypergraphs |
| Grantee: | Jie Han |
| Support Opportunities: | Scholarships abroad - Research Internship - Post-doctor |
| 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 |