Hostname: page-component-7b7567c8c-48dgx Total loading time: 0 Render date: 2026-11-18T05:58:06.289Z Has data issue: false hasContentIssue false

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
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)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Paper
Copyright
Copyright © Cambridge University Press 2012