Minimum Codegree Threshold for C63-Factors in 3-Uniform Hypergraphs

被引：8

作者：

Gao, Wei ^{[1
]}

Han, Jie ^{[2
]}

机构：

[1] Auburn Univ, Dept Math & Stat, 221 Parker Hall, Auburn, AL 36849 USA

[2] Univ Sao Paulo, Inst Matemat & Estat, Rua Matao 1010, Sao Paulo, Brazil

来源：

COMBINATORICS PROBABILITY & COMPUTING | 2017年 / 26卷 / 04期

基金：

巴西圣保罗研究基金会;

关键词：

LOOSE HAMILTON CYCLES; PERFECT MATCHINGS; UNIFORM HYPERGRAPHS; PACKING;

D O I：

10.1017/S0963548317000104

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：536 / 559

页数：24