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

O. Cooley; J. Hladký; Diana Piguet

doi:10.1016/j.endm.2009.07.103

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

O. Cooley, J. Hladký, Diana Piguet

Publikation: Beitrag in einer Fachzeitschrift › Artikel › Begutachtung

Abstract

We prove a version of the Loebl-Komlós-Sós Conjecture for large dense graphs. For any there exists such that for any holds: If G has median degree at least k, then any tree of order at most is a subgraph of G.

Originalsprache	englisch
Seiten (von - bis)	609-613
Fachzeitschrift	Electronic Notes in Discrete Mathematics
Jahrgang	34
DOIs	https://doi.org/10.1016/j.endm.2009.07.103
Publikationsstatus	Veröffentlicht - 2009
Extern publiziert	Ja

Zugriff auf Dokument

10.1016/j.endm.2009.07.103

Andere Dateien und Links

http://www.scopus.com/inward/record.url?eid=2-s2.0-67651160476&partnerID=MN8TOARS

Dieses zitieren

@article{bcd55637593d45b4b015d707a884234e,

title = "Loebl-Koml{\'o}s-S{\'o}s Conjecture: dense case",

abstract = "We prove a version of the Loebl-Koml{\'o}s-S{\'o}s Conjecture for large dense graphs. For any there exists such that for any holds: If G has median degree at least k, then any tree of order at most is a subgraph of G.",

author = "O. Cooley and J. Hladk{\'y} and Diana Piguet",

year = "2009",

doi = "10.1016/j.endm.2009.07.103",

language = "English",

volume = "34",

pages = "609--613",

journal = "Electronic Notes in Discrete Mathematics",

issn = "1571-0653",

publisher = "Elsevier B.V.",

}

TY - JOUR

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

AU - Cooley, O.

AU - Hladký, J.

AU - Piguet, Diana

PY - 2009

Y1 - 2009

N2 - We prove a version of the Loebl-Komlós-Sós Conjecture for large dense graphs. For any there exists such that for any holds: If G has median degree at least k, then any tree of order at most is a subgraph of G.

AB - We prove a version of the Loebl-Komlós-Sós Conjecture for large dense graphs. For any there exists such that for any holds: If G has median degree at least k, then any tree of order at most is a subgraph of G.

UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-67651160476&partnerID=MN8TOARS

U2 - 10.1016/j.endm.2009.07.103

DO - 10.1016/j.endm.2009.07.103

M3 - Article

SN - 1571-0653

VL - 34

SP - 609

EP - 613

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

ER -

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

Abstract

Zugriff auf Dokument

Andere Dateien und Links

Fingerprint

Dieses zitieren