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

DOI10.1016/j.endm.2009.07.103zbMath1273.05126arXiv0805.4834OpenAlexW2597014738WikidataQ122961691 ScholiaQ122961691MaRDI QIDQ2851529

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)

Related Items (1)

Embedding trees in graphs with independence number two

Cites Work

• Unnamed Item
• Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
• An approximate version of the Loebl-Komlós-Sós conjecture

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