加载中…
2012-05-30
On the Maximum Number of Edges in a Hypergraph with Given Matching Number
Peter Frankl
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本