Hostname: page-component-78c5997874-ndw9j Total loading time: 0 Render date: 2024-11-14T08:47:40.219Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  02 February 2012

PETER FRANKL ,
VOJTECH RÖDL  and
ANDRZEJ RUCIŃSKI
PETER FRANKL
Affiliation:
3-12-25 Shibuya, Shibuya-ku, Tokyo 150-0002, Japan (e-mail: peter.frankl@gmail.com)
VOJTECH RÖDL
Affiliation:
Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322, USA (e-mail: rodl@mathcs.emory.edu)
ANDRZEJ RUCIŃSKI
Affiliation:
Department of Discrete Mathematics, Adam Mickiewicz University, Poznań, Poland 61-614 (e-mail: rucinski@amu.edu.pl)
Get access Rights & Permissions [Opens in a new window]

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.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 21 , Issue 1-2: Honouring the Memory of Richard H. Schelp , March 2012 , pp. 141 - 148
Copyright
Copyright © Cambridge University Press 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[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.Google Scholar
[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 25–32.Google Scholar
[3]Erdős, P. (1965) A problem on independent r-tuples. Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 8 93–95.Google Scholar
[4]Erdős, P. and Gallai, T. (1959) On maximal paths and circuits of graphs. Acta Math. Acad. Sci. Hungar. 10 337–356.Google Scholar
[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. 81–110.Google Scholar
[6]Frankl, P. and Füredi, Z. Unpublished.Google Scholar
[7]Huang, H., Loh, P. and Sudakov, B. The size of a hypergraph and its matching number. Submitted.Google Scholar
[8]Khan, I. Perfect matchings in 4-uniform hypergraphs. Submitted.Google Scholar
[9]Lo, A. and Markström, K.F-factors in hypergraphs via absorption. Submitted.Google Scholar
[10]Markström, K. and Ruciński, A. (2011) Perfect matchings and Hamilton cycles in hypergraphs with large degrees. Europ. J. Combin. 32 677–687.Google Scholar
[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.Google Scholar