论文信息 - The Size of a Hypergraph and its Matching Number

The Size of a Hypergraph and its Matching Number

More than forty years ago, Erdős conjectured that for any $t \leq \frac{n}{k}$, every k-uniform hypergraph on n vertices without t disjoint edges has at most max${\binom{kt-1}{k}, \binom{n}{k}-\binom{n-t+1}{k}\}$ edges. Although this appears to be a basic instance of the hypergraph Turán problem (with a t-edge matching as the excluded hypergraph), progress on this question has remained elusive. In this paper, we verify this conjecture for all $t < \frac{n}{3k^2}$. This improves upon the best previously known range $t = O\bigl(\frac{n}{k^3}\bigr)$, which dates back to the 1970s.

[1] P. Erdos,et al. On maximal paths and circuits of graphs , 1959 .

[2] P. Erdös,et al. INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS , 1961 .

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

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

[5] D. Kleitman. On a conjecture of milner on k-graphs with non-disjoint edges , 1968 .

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

[7] B. Bollobás. Surveys in Combinatorics , 1979 .

[8] Zoltán Füredi,et al. A new generalization of the Erdős-Ko-Rado theorem , 1983, Comb..

[9] László Pyber,et al. A new generalization of the Erdös-Ko-Rado theorem , 1986, J. Comb. Theory A.

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

[11] D. Howard. SIZE CONDITIONS FOR THE EXISTENCE OF RAINBOW MATCHINGS , 2011 .

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

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

[14] 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.