On Erdos' extremal problem on matchings in hypergraphs

Abstract

In 1965 Erdős conjectured that the number of edges in k-uniform hypergraphs on n vertices in which the largest matching has s edges is maximized for hypergraphs of one of two special types. We settled this conjecture in the affirmative for k=3 and n is large enough.

References in corpus (1)

• On the Maximum Number of Edges in a Hypergraph with Given Matching Number

Cited by in corpus (15)

• Fractional and integer matchings in uniform hypergraphs
• Global hypercontractivity and its applications
• Families with no $s$ pairwise disjoint sets
• On the Maximum Number of Edges in a Hypergraph with Given Matching Number
• A better bound on the size of rainbow matchings
• Hypergraph Turan numbers of linear cycles
• On the rainbow matching conjecture for 3-uniform hypergraphs
• Rainbow version of the Erd\H os Matching Conjecture via Concentration
• Linear trees in uniform hypergraphs
• Rainbow perfect matchings for 4-uniform hypergraphs
• On stability of rainbow matchings
• Large $Y_{k,b}$-tilings and Hamilton $\ell$-cycles in $k$-uniform hypergraphs
• Rainbow matchings for 3-uniform hypergraphs
• Vertex degree sums for matchings in 3-uniform hypergraphs
• Structure of the largest subgraphs of $G_{n,p}$ with a given matching number