arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1107.5544math.CO
收藏

超图的大小及其匹配数

The size of a hypergraph and its matching number

Hao Huang, Po-Shen Loh, Benny Sudakov

摘要:

40多年前,Erdegan证明了对任意T <= N/K,N个顶点上的K一致超图中不存在T条不相交边,最多有{ \binom{KT-1}{K},\binom{N}{K} - \binom{N-T+1}{K} }条边.虽然这似乎是超图图兰问题的一个基本实例(用T边匹配作为排除超图),但这个问题的进展仍然难以捉摸。在本文中,我们证明了这一猜想对所有T < N/(3K^2)。这改进了先前已知的最佳范围T = O(N/K^3),该范围可以追溯到20世纪70年代。

英文摘要:

More than forty years ago, Erdős conjectured that for any T <= N/K, every K-uniform hypergraph on N vertices without T disjoint edges has at most max{\binom{KT-1}{K}, \binom{N}{K} - \binom{N-T+1}{K}} edges. Although this appears to be a basic instance of the hypergraph Turán problem (with a T-edge matching as the excluded hypergraph), progress on this question has remained elusive. In this paper, we verify this conjecture for all T < N/(3K^2). This improves upon the best previously known range T = O(N/K^3), which dates back to the 1970's.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑