Article contents
Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles
Published online by Cambridge University Press: 09 July 2019
Abstract
Given two k-graphs (k-uniform hypergraphs) F and H, a perfect F-tiling (or F-factor) in H is a set of vertex-disjoint copies of F that together cover the vertex set of H. For all complete k-partite k-graphs K, Mycroft proved a minimum codegree condition that guarantees a K-factor in an n-vertex k-graph, which is tight up to an error term o(n). In this paper we improve the error term in Mycroft’s result to a sublinear term that relates to the Turán number of K when the differences of the sizes of the vertex classes of K are co-prime. Furthermore, we find a construction which shows that our improved codegree condition is asymptotically tight in infinitely many cases, thus disproving a conjecture of Mycroft. Finally, we determine exact minimum codegree conditions for tiling K(k)(1, … , 1, 2) and tiling loose cycles, thus generalizing the results of Czygrinow, DeBiasio and Nagle, and of Czygrinow, respectively.
MSC classification
- Type
- Paper
- Information
- Copyright
- © Cambridge University Press 2019
Footnotes
Supported by FAPESP (Proc. 2013/03447-6, 2014/18641-5, 2015/07869-8) and Simons Foundation Collaboration Grant # 630884.
Partially supported by NSF grants DMS-1400073 and DMS 1700622.
References
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191004170822444-0753:S096354831900021X:S096354831900021X_inline1.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191004170822444-0753:S096354831900021X:S096354831900021X_inline2.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191004170822444-0753:S096354831900021X:S096354831900021X_inline3.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191004170822444-0753:S096354831900021X:S096354831900021X_inline4.gif?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20191004170822444-0753:S096354831900021X:S096354831900021X_inline5.gif?pub-status=live)
- 3
- Cited by