Indexed metadata
On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
PETER FRANKL, VOJTECH RÖDL, ANDRZEJ RUCIŃSKI
Source record
Source: Crossref
Published: Feb 2, 2012
DOI: 10.1017/s0963548311000496
Open original source ↗Source 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 ≥ 4 s .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.