Loebl-Komlós-Sós conjecture: dense case

DOI10.1016/J.ENDM.2009.07.103MaRDI QIDQ2851529zbMATH OpenOpenAlexWikidataFDO

Authors Oliver Cooley, Jan Hladký, Diana Piguet

Publication date 10 October 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0805.4834

Mathematics Subject Classification ID

Vertex degrees (05C07) Density (toughness, etc.) (05C42)

Abstract: We prove a version of the Loebl-Komlos-Sos Conjecture for dense graphs. For each q>0 there exists a number $n_{0}inmathbbN$ such that for any n>n_0 and k>qn the following holds: if G be a graph of order n with at least n/2 vertices of degree at least k, then any tree of order k+1 is a subgraph of G.

Recommendations

• Loebl-Komlós-Sós conjecture: dense case
• Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
• An approximate version of the Loebl-Komlós-Sós conjecture
• On the Loebl-Koml�s-S�s conjecture
• An approximate version of the Loebl-Komlós-Sós conjecture

Cites work

• An approximate version of the Loebl-Komlós-Sós conjecture
• scientific article; zbMATH DE number 881162 (Why is no real title available?)
• Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs

Cited in

(4)

• Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
• A skew version of the Loebl-Komlós-Sós conjecture
• Embedding trees in graphs with independence number two
• Loebl-Komlós-Sós conjecture: dense case

This page was built for publication: Loebl-Komlós-Sós conjecture: dense case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851529)