Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels

In this paper we study degree conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conjecture by Erdos on estimating the maximum number of edges in a hypergraph when the (fractional) matching number is given, which we are able to solve in some special cases using probabilistic techniques. Based on these results, we obtain some general theorems on the minimum d-degree ensuring the existence of perfect (fractional) matchings. In particular, we asymptotically determine the minimum vertex degree which guarantees a perfect matching in 4-uniform and 5-uniform hypergraphs. We also discuss an application to a problem of finding an optimal data allocation in a distributed storage system.

[1]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

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

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

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

[5]  Vojtech Rödl,et al.  An approximate Dirac-type theorem for k-uniform hypergraphs , 2008, Comb..

[6]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

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

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

[9]  Mohsen Sardari,et al.  Memory allocation in distributed storage networks , 2010, 2010 IEEE International Symposium on Information Theory.

[10]  Vojtech Rödl,et al.  Near Perfect Coverings in Graphs and Hypergraphs , 1985, Eur. J. Comb..

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

[12]  Vojtech Rödl,et al.  On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size , 2012, Combinatorics, Probability and Computing.

[13]  S. M. Samuels.  On a Chebyshev-Type Inequality for Sums of Independent Random Variables , 1966 .

[14]  Endre Szemer,et al.  AN APPROXIMATE DIRAC-TYPE THEOREM FOR k-UNIFORM HYPERGRAPHS , 2008 .

[15]  P. Erdgs,et al.  ON MAXIMAL PATHS AND CIRCUITS OF GRAPHS , 2002 .

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

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

[18]  Noga Alon,et al.  Nonnegative k-sums, fractional covers, and probability of small deviations , 2012, J. Comb. Theory, Ser. B.

[19]  Alexandros G. Dimakis,et al.  Distributed Storage Allocations , 2010, IEEE Transactions on Information Theory.

[20]  Moni Naor,et al.  Optimal File Sharing in Distributed Networks , 1995, SIAM J. Comput..

[21]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

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

[23]  G. Dirac.  Some Theorems on Abstract Graphs , 1952 .

[24]  P. Erdos.  A PROBLEM ON INDEPENDENT r-TUPLES , 1965 .

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

[26]  Alexandros G. Dimakis,et al.  Symmetric Allocations for Distributed Storage , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

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

[28]  Hao Huang,et al.  The Size of a Hypergraph and its Matching Number , 2011, Combinatorics, Probability and Computing.