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

Szemerédi和Petruska猜想的等价性及$3$ -一致$τ$ -临界超图的最大阶

The equivalence of the Szemerédi and Petruska conjecture and the maximum order of $3$-uniform $τ$-critical hypergraphs

André E. Kézdy, Jenő Lehel

摘要:

最近,我们渐近解决了长期存在的Szemerédi和Petruska猜想。几十年前,Gyárfás等人通过一个直接但未发表的论证观察到,这个猜想等价于确定$3$ -一致$τ$ -临界超图的最大阶的问题。因此,一个渐近紧的上界的最大阶的$3$ -一致$τ$ -临界超图如下,从我们最近的工作,重新唤醒兴趣,在这种等价性。在这篇文章中,我们提供了一个简单的证明这个等价。我们还提出了相关的背景与开放的问题,并提到组合几何应用的Szemerédi和Petruska猜想。

英文摘要:

Recently we asymptotically resolved the long-standing Szemerédi and Petruska conjecture. Several decades ago Gyárfás et al. observed, via a straightforward but unpublished argument, that this conjecture is equivalent to the problem of determining the maximum order of a $3$-uniform $τ$-critical hypergraph. Consequently, an asymptotically tight upper bound for the maximum order of a $3$-uniform $τ$-critical hypergraph follows from our recent work, reawakening interest in this equivalence. In this companion paper we supply a simple proof of this equivalence. We also present related background with open problems, and mention combinatorial geometry applications of the Szemerédi and Petruska conjecture.

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

↑