On the Maximum Number of Edges in a Hypergraph with Given Matching Number
classification
🧮 math.CO
keywords
numberbinomedgeshypergraphmatchingmaximumgivenprove
read the original abstract
The aim of the present paper is to prove that the maximum number of edges in a 3-uniform hypergraph on n vertices and matching number s is max{\binom(3s+2,3), \binom(n,3) - \binom(n-s,3)} for all n,s, n >= 3s+2.
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.