On the Maximum Number of Edges in a Hypergraph with Given Matching Number
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+2,3), (n,3) - (n-s,3) for all n,s, n >= 3s+2.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.