Matchings in 3-uniform hypergraphs

We determine the minimum vertex degree that ensures a perfect matching in a 3-uniform hypergraph. More precisely, suppose that H is a sufficiently large 3-uniform hypergraph whose order n is divisible by 3. If the minimum vertex degree of H is greater than (n-12)-(2n/32), then H contains a perfect matching. This bound is tight and answers a question of Han, Person and Schacht. More generally, we show that H contains a matching of size d=

[1]  Imdadullah Khan,et al.  Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree , 2011, SIAM J. Discret. Math..

[2]  Vojtech Rödl,et al.  Perfect matchings in uniform hypergraphs with large minimum degree , 2006, Eur. J. Comb..

[3]  Andrzej Czygrinow,et al.  Tight Co-Degree Condition for Perfect Matchings in 4-Graphs , 2012, Electron. J. Comb..

[4]  Oleg Pikhurko,et al.  Perfect Matchings and K43-Tilings in Hypergraphs of Large Codegree , 2008, Graphs Comb..

[5]  Daniela Kühn,et al.  Matchings in hypergraphs of large minimum degree , 2006 .

[6]  D. Kuhn,et al.  Surveys in Combinatorics 2009: Embedding large subgraphs into dense graphs , 2009, 0901.3541.

[7]  Andrzej Rucinski,et al.  Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees , 2011, Eur. J. Comb..

[8]  Marek Karpi Nski,et al.  COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY , 2010 .

[9]  Hiêp Hàn,et al.  On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree , 2009, SIAM J. Discret. Math..

[10]  Vojtech Rödl,et al.  Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve) , 2010 .

[11]  Vojtech Rödl,et al.  Perfect matchings in large uniform hypergraphs with large minimum collective degree , 2009, J. Comb. Theory, Ser. A.

[12]  D. E. Daykin,et al.  SETS OF INDEPENDENT EDGES OF A HYPERGRAPH , 1976 .

[13]  Marek Karpinski,et al.  Computational Complexity of the Perfect Matching Problem in Hypergraphs with Subcritical Density , 2010, Int. J. Found. Comput. Sci..

[14]  Ron Aharoni,et al.  Perfect matchings in r-partite r-graphs , 2009, Eur. J. Comb..

[15]  W. T. Tutte.  The Factorization of Linear Graphs , 1947 .

[16]  Vojtech Rödl,et al.  Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels , 2011, J. Comb. Theory, Ser. A.

[17]  Klas Markström,et al.  Perfect matchings in 3-partite 3-uniform hypergraphs , 2011, J. Comb. Theory, Ser. A.

[18]  David E. Daykin,et al.  Degrees giving independent edges in a hypergraph , 1981, Bulletin of the Australian Mathematical Society.

[19]  Yi Zhao,et al.  Exact minimum degree thresholds for perfect matchings in uniform hypergraphs , 2012, J. Comb. Theory, Ser. A.