arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0712.2618math.CO
收藏

关于2-交边不含重复副本的极k-图

On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges

Yeow Meng Chee, Alan C. H. Ling

摘要:

确定一个给定超图族中某个元素至多包含r个同构副本的极超图的问题首先由Boros等人在2001年研究。除了那些与经典的Turan数等价的超图之外,关于相应的极值超图的大小,没有多少超图族有确切的结果。本文确定了在{3,4}中k至多包含一对2-相交边的极k-一致超图的尺寸。我们给出了一个完整的解决方案时,k=3和一个几乎完全的解决方案(有11个例外)时,k=4。

英文摘要:

The problem of determining extremal hypergraphs containing at most r isomorphic copies of some element of a given hypergraph family was first studied by Boros et al. in 2001. There are not many hypergraph families for which exact results are known concerning the size of the corresponding extremal hypergraphs, except for those equivalent to the classical Turan numbers. In this paper, we determine the size of extremal k-uniform hypergraphs containing at most one pair of 2-intersecting edges for k in {3,4}. We give a complete solution when k=3 and an almost complete solution (with eleven exceptions) when k=4.

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

↑