TY - JOUR
T1 - Minimum Codegree Threshold for C63-Factors in 3-Uniform Hypergraphs
AU - Gao, Wei
AU - Han, Jie
N1 - Publisher Copyright:
© 2017 Cambridge University Press.
PY - 2017/7/1
Y1 - 2017/7/1
N2 - Let C63 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 C63-factor, that is, a spanning subhypergraph consisting of vertex-disjoint copies of C63. The minimum codegree condition is best possible. This improves the asymptotic result obtained by Mycroft and answers a question of Rödl and Ruciński exactly.
AB - Let C63 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 C63-factor, that is, a spanning subhypergraph consisting of vertex-disjoint copies of C63. The minimum codegree condition is best possible. This improves the asymptotic result obtained by Mycroft and answers a question of Rödl and Ruciński exactly.
UR - http://www.scopus.com/inward/record.url?scp=85015801127&partnerID=8YFLogxK
U2 - 10.1017/S0963548317000104
DO - 10.1017/S0963548317000104
M3 - Article
AN - SCOPUS:85015801127
SN - 0963-5483
VL - 26
SP - 536
EP - 559
JO - Combinatorics Probability and Computing
JF - Combinatorics Probability and Computing
IS - 4
ER -