On Erdos' extremal problem on matchings in hypergraphs
classification
🧮 math.CO
keywords
hypergraphsedgesaffirmativeconjectureconjecturedenougherdosextremal
read the original abstract
In 1965 Erd\H{o}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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.