arXiv Analytics

Sign in

arXiv:1205.6847 [math.CO]AbstractReferencesReviewsResources

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

Peter Frankl

Published 2012-05-30Version 1

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.

Comments: 26 pages
Categories: math.CO
Subjects: 05C65, 05C70
Related articles: Most relevant | Search more
arXiv:2207.03130 [math.CO] (Published 2022-07-07)
On the maximum number of edges in planar graphs of bounded degree and matching number
arXiv:2402.12884 [math.CO] (Published 2024-02-20, updated 2024-08-20)
Lower bounds for the Randić index in terms of matching number
arXiv:1107.5544 [math.CO] (Published 2011-07-27, updated 2011-09-15)
The size of a hypergraph and its matching number

Links

Toolbox