The Library
Loebl-Komlós-Sós conjecture : dense case
Tools
Tools
Tools
Cooley, Oliver, Hladký, Jan and Piguet, Diana (2009) Loebl-Komlós-Sós conjecture : dense case. Electronic Notes in Discrete Mathematics, Vol.34 . pp. 609-613. doi:10.1016/j.endm.2009.07.103 ISSN 1571-0653.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1016/j.endm.2009.07.103
Abstract
We prove a version of the Loebl-Komlós-Sós Conjecture for large dense graphs. For any q>0 there exists n0∈N such that for any n>n0 holds: If G has median degree at least k, then any tree of order at most k+1 is a subgraph of G.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||
| Journal or Publication Title: | Electronic Notes in Discrete Mathematics | ||||
| Publisher: | Elsevier BV | ||||
| ISSN: | 1571-0653 | ||||
| Official Date: | 2009 | ||||
| Dates: |
|
||||
| Volume: | Vol.34 | ||||
| Page Range: | pp. 609-613 | ||||
| DOI: | 10.1016/j.endm.2009.07.103 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
