Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
type: Item
instance of: scholarly article
title: Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
zbMATH Open document ID: 1184.05067
author: Oliver Cooley
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5648072
zbMATH Keywords: embedding
zbMATH Keywords: regularity Lemma
zbMATH Keywords: Loebl-Komlós-Sós conjecture
zbMATH Keywords: Ramsey numbers of trees
MaRDI profile type: Publication
full work available at URL: j.disc.2009.05.030
OpenAlex ID: W2094002291
Wikidata QID: Q122981846
cites work: On the Loebl-Koml�s-S�s conjecture
cites work: Q5315023
cites work: Constructing Trees in Graphs whose Complement has no K2,s
cites work: Q4878286
cites work: Q5548200
cites work: Q4878666
cites work: The Erdős‐Sós Conjecture for trees of diameter four
cites work: An approximate version of the Loebl-Komlós-Sós conjecture
cites work: The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars
cites work: The Erdös-Sós conjecture for graphs without \(C_ 4\)
cites work: The Komlós conjecture for graphs of girth 7
cites work: Q5294940
DOI: 10.1016/J.DISC.2009.05.030
description: scientific article; zbMATH DE number 5648072