Loebl-Komlós-Sós Conjecture: Dense case

详细信息    查看全文

• 作者：Jan Hladký ; ^a ; ¹ ; ^{honzahladky@gmail.com" class="auth_mail" title="E-mail the corresponding author} ; Diana Piguet^b ; ²
• 关键词：Loebl&ndash ; Komló ; s&ndash ; Só ; s Conjecture ; Ramsey number of trees
• 刊名：Journal of Combinatorial Theory, Series B
• 出版年：2016
• 出版时间：January 2016
• 年：2016
• 卷：116
• 期：Complete
• 页码：123-190
• 全文大小：1218 K

文摘

We prove a version of the Loebl–Komlós–Sós Conjecture for dense graphs. For each q>0$q>0$ there exists a number n₀∈N$n_0\in \mathbb{N}$ such that for each n>n₀$n>n_0$ and k>qn$k>qn$ the following holds: if G is a graph of order n   with at least $\frac{n}{2}$ vertices of degree at least k  , then each tree of order k+1$k+1$ is a subgraph of G.