The Approximate Loebl-Komlos-Sos Conjecture III: The Finer Structure of LKS Graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F17%3A00474830" target="_blank" >RIV/67985807:_____/17:00474830 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1137/140982866" target="_blank" >http://dx.doi.org/10.1137/140982866</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1137/140982866" target="_blank" >10.1137/140982866</a>

Result language
angličtina
Original language name
The Approximate Loebl-Komlos-Sos Conjecture III: The Finer Structure of LKS Graphs
Original language description
This is the third of a series of four papers in which we prove the following relaxation of the Loebl--Komlós--Sós conjecture: For every $alpha>0$ there exists a number $k_0$ such that for every $k>k_0$, every $n$-vertex graph $G$ with at least $(frac12+alpha)n$ vertices of degree at least $(1+alpha)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 fourth paper, the refined structure will be used for embedding the tree $T$.n
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)