On the maximum number of edges in a hypergraph with given matching number

详细信息    查看全文

• 作者：Peter Frankl ^{peter.frankl@gmail.com}
• 关键词：Hypergraph
• 刊名：Discrete Applied Mathematics
• 出版年：2017
• 出版时间：10 January 2017
• 年：2017
• 卷：216
• 期：part_P3
• 页码：562-581
• 全文大小：534 K
• 卷排序：216

文摘

The aim of the present paper is to prove that the maximum number of edges in a 3-uniform hypergraph on nn vertices and matching number ss is max{(3s+23),(n3)−(n−s3)} for all n,s,n≥3s+2.