Article ID Journal Published Year Pages File Type
4949839 Discrete Applied Mathematics 2017 20 Pages PDF
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{(3s+23),(n3)−(n−s3)} for all n,s,n≥3s+2.
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
On the maximum number of edges in a hypergraph with given matching number
Authors
,