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

近似Loebl-Komlós-Sós猜想IV:嵌入技巧及主要结果的证明

The approximate Loebl-Komlós-Sós Conjecture IV: Embedding techniques and the proof of the main result

Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya J. Stein, Endre Szemerédi

摘要:

这是最后一个文件的一系列四个文件中,我们证明了以下放松的Loebl-Komlos-索斯猜想:对于每一个$α>0$存在一个数$k_0$,使每个$k>k_0$每个$n$ -顶点图$G$与至少$(\frac12+α)n$顶点的程度至少$(1+α)k$包含每个树$T$的顺序$k$作为一个子图。在本系列的前两篇论文中,我们分解了宿主图$G$,并在分解内部找到了合适的组合结构。在第三篇论文中,我们改进了这个结构,并证明了任何满足上述近似版本的Loebl-Komlos-Sos猜想的条件的图包含十个特定配置之一。在本文中,我们嵌入树$T$在每十个配置。

英文摘要:

This is the last paper 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 two papers of this series, we decomposed the host graph $G$, and found a suitable combinatorial structure inside the decomposition. In the third paper, we refined this structure, and proved that any graph satisfying the conditions of the above approximate version of the Loebl-Komlos-Sos Conjecture contains one of ten specific configurations. In this paper we embed the tree $T$ in each of the ten configurations.

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

↑