A Note on Perfect Matchings in Uniform Hypergraphs

We determine the exact minimum $\ell$-degree threshold for perfect matchings in $k$-uniform hypergraphs when the corresponding threshold for perfect fractional matchings is significantly less than $\frac{1}{2}\left( \begin{array}{c} n \\ k- \ell\end{array}\right)$. This extends our previous results that determine the minimum $\ell$-degree thresholds for perfect matchings in $k$-uniform hypergraphs for all $\ell\ge k/2$ and provides two new (exact) thresholds: $(k,\ell)=(5,2)$ and $(7,3)$.

[1]  Daniela Kühn,et al.  Matchings in hypergraphs of large minimum degree , 2006, J. Graph Theory.

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

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

[4]  Jie Han,et al.  Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture , 2015, SIAM J. Discret. Math..

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

[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]  Yi Zhao,et al.  Exact minimum degree thresholds for perfect matchings in uniform hypergraphs , 2012, J. Comb. Theory, Ser. A.

[9]  Daniela Kühn,et al.  Fractional and integer matchings in uniform hypergraphs , 2013, Eur. J. Comb..

[10]  Daniela Kühn,et al.  Matchings in 3-uniform hypergraphs , 2010, J. Comb. Theory, Ser. B.

[11]  Imdadullah Khan,et al.  Perfect matchings in 4-uniform hypergraphs , 2011, J. Comb. Theory, Ser. B.

[12]  Klas Markström,et al.  $$F$$F-Factors in Hypergraphs Via Absorption , 2011, Graphs Comb..

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

[14]  Jie Han,et al.  Near Perfect Matchings in k-Uniform Hypergraphs , 2014, Combinatorics, Probability and Computing.

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

[16]  Peter Keevash,et al.  A Geometric Theory for Hypergraph Matching , 2011, 1108.1757.

[17]  Klas Markström,et al.  $F$-factors in hypergraphs via absorption , 2011 .

[18]  J. Solymosi,et al.  An irregular mind : Szemerédi is 70 , 2010 .

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

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

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