近似Loebl-Komlós-Sós猜想III:LKS图的精细结构
The Approximate Loebl-Komlós-Sós Conjecture III: The finer structure of LKS graphs
摘要:
这是第三个一系列的四个文件中,我们证明了以下放松的Loebl-Komlos-索斯猜想:对于每一个$α>0$存在一个数字$k_0$,使每一个$k>k_0$每一个$n$ -顶点图$G$与至少$(\frac12+α)n$顶点的程度至少$(1+α)k$包含每个树$T$的顺序$k$作为一个子图。在本系列的第一篇论文中,我们将图$G$分解为几个具有不同特征的部分。在第二篇论文中,我们发现了分解内部的组合结构。在本文中,我们将给出这种结构的改进。在即将到来的第四篇论文中,细化的结构将用于嵌入树$T$。
英文摘要:
This is the third of a series of four papers in which we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $α>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at least $(\frac12+α)n$ vertices of degree at least $(1+α)k$ contains each tree $T$ of order $k$ as a subgraph. In the first paper of the series, we gave a decomposition of the graph $G$ into several parts of different characteristics. In the second paper, we found a combinatorial structure inside the decomposition. In this paper, we will give a refinement of this structure. In the forthcoming fourth paper, the refined structure will be used for embedding the tree $T$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。