Skip to main content
×
×
Home

On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size

  • PETER FRANKL (a1), VOJTECH RÖDL (a2) and ANDRZEJ RUCIŃSKI (a3)
Abstract

In 1965 Erdős conjectured a formula for the maximum number of edges in a k-uniform n-vertex hypergraph without a matching of size s. We prove this conjecture for k = 3 and all s ≥ 1 and n ≥ 4s.

Copyright
References
Hide All
[1]Alon, N., Frankl, P., Huang, H., Rödl, V., Ruciński, A. and Sudakov, B. On the existence of large matchings and fractional matchings in uniform hypergraphs. Submitted.
[2]Bollobás, B., Daykin, D. E. and Erdős, P. (1976) Sets of independent edges of a hypergraph. Quart. J. Math. Oxford (2) 27 2532.
[3]Erdős, P. (1965) A problem on independent r-tuples. Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 8 9395.
[4]Erdős, P. and Gallai, T. (1959) On maximal paths and circuits of graphs. Acta Math. Acad. Sci. Hungar. 10 337356.
[5]Frankl, P. (1987) The shifting technique in extremal set theory. In Surveys in Combinatorics, Vol. 123 of London Mathematical Society Lecture Notes, Cambridge University Press, pp. 81110.
[6]Frankl, P. and Füredi, Z. Unpublished.
[7]Huang, H., Loh, P. and Sudakov, B. The size of a hypergraph and its matching number. Submitted.
[8]Khan, I. Perfect matchings in 4-uniform hypergraphs. Submitted.
[9]Lo, A. and Markström, K.F-factors in hypergraphs via absorption. Submitted.
[10]Markström, K. and Ruciński, A. (2011) Perfect matchings and Hamilton cycles in hypergraphs with large degrees. Europ. J. Combin. 32 677687.
[11]Rödl, V. and Ruciński, A. (2010) Dirac-type questions for hypergraphs: A survey (or more problems for Endre to solve). In An Irregular Mind: Szemerédi is 70, Vol. 21 of Bolyai Soc. Math. Studies, pp. 561–590.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed