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

Erdős-Sós猜想中的超稳定性

Hyperstability in the Erdős-Sós Conjecture

Alexey Pokrovskiy

AI总结:

本文证明了不含特定有界度树的图的结构定理,可将稀疏无T图问题转化为稠密无T图问题,并以此证明了Erdős-Sós猜想对大有界度树成立。

摘要:

本文证明了关于不含任何有界度树 $T$ 副本的图 $G$ 的一个粗糙结构定理:从任何这样的 $G$ 中,可以删除 $o(|G||T|)$ 条边,从而得到一个子图,其所有连通分支均具有阶为 $3|T|$ 的覆盖。该定理能够将关于稀疏 $T$-free图(对此了解相对较少)的问题转化为关于稠密 $T$-free图(对此有正则性等强大技术)的问题。它有各种应用,最显著的是证明了Erdős-Sós猜想对大有界度树成立。

英文摘要:

A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order $3|T|$. This theorem has the ability to turn questions about sparse $T$-free graphs (about which relatively little is known), into questions about dense $T$-free graphs (for which we have powerful techniques like regularity). There are various applications, the most notable being a proof of the Erdős-Sós Conjecture for large, bounded degree trees.

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

↑