Number of the records: 1
Loebl-Komlós-Sós Conjecture: dense case
- 1.
SYSNO ASEP 0451115 Document Type J - Journal Article R&D Document Type Journal Article Subsidiary J Článek ve WOS Title Loebl-Komlós-Sós Conjecture: dense case Author(s) Hladký, Jan (MU-W) RID, SAI, ORCID
Piguet, Diana (UIVT-O) RID, ORCID, SAISource Title Journal of Combinatorial Theory. B. - : Academic Press - ISSN 0095-8956
Roč. 116, January (2016), s. 123-190Number of pages 68 s. Language eng - English Country US - United States Keywords Loebl-Komlós-Sós Conjecture ; Ramsey number of trees Subject RIV BA - General Mathematics R&D Projects 1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS) Institutional support MU-W - RVO:67985840 ; UIVT-O - RVO:67985807 UT WOS 000366344100005 EID SCOPUS 84947616470 DOI 10.1016/j.jctb.2015.07.004 Annotation We prove a version of the Loebl-Komlos-Sos Conjecture for dense graphs. For each $q>0$ there exists a number $n_0 \in \mathbb N$ such that for each $n>n_0$ and $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$ is a subgraph of $G$. Workplace Mathematical Institute Contact Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757 Year of Publishing 2017
Number of the records: 1