如何建立一个支柱:一个证明的martassen猜想
How to build a pillar: a proof of Thomassen's conjecture
摘要:
Carsten Schlassen在1989年提出,如果一个图的最小度大于宇宙中的原子数($δ(G)\ge 10^{10^{10}}$),那么它包含一个柱,这是一个由两个相同长度的顶点不相交的圈组成的图,比如说$s$,以及相同长度的$s$顶点不相交的路,这些路将匹配的顶点按顺序连接在圈周围。尽管在过去的三十年里,柱子的结构很简单,而且路径和循环的嵌入方法也有了各种各样的发展,但这个看起来很天真的猜想迄今为止还没有取得任何进展。在本文中,我们给出了一个证明这个猜想的方法,建立一个支柱(算法)在次线性扩张。
英文摘要:
Carsten Thomassen in 1989 conjectured that if a graph has minimum degree more than the number of atoms in the universe ($δ(G)\ge 10^{10^{10}}$), then it contains a pillar, which is a graph that consists of two vertex-disjoint cycles of the same length, $s$ say, along with $s$ vertex-disjoint paths of the same length which connect matching vertices in order around the cycles. Despite the simplicity of the structure of pillars and various developments of powerful embedding methods for paths and cycles in the past three decades, this innocent looking conjecture has seen no progress to date. In this paper, we give a proof of this conjecture by building a pillar (algorithmically) in sublinear expanders.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。