Mostra el registre d'ítem simple
Every tree is a large subtree of a tree that decomposes Kn or Kn,n
dc.contributor.author | Lladó Sánchez, Ana M. |
dc.contributor.author | López Masip, Susana Clara |
dc.contributor.author | Moragas Vilarnau, Jordi |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV |
dc.date.accessioned | 2010-07-14T08:30:33Z |
dc.date.available | 2010-07-14T08:30:33Z |
dc.date.created | 2010-02-28 |
dc.date.issued | 2010-02-28 |
dc.identifier.citation | Llado, A.; López, S.C.; Moragas, J. Every tree is a large subtree of a tree that decomposes Kn or Kn,n. "Discrete mathematics", 28 Febrer 2010, vol. 310, núm. 4, p. 838-842. |
dc.identifier.issn | 0012-365X |
dc.identifier.uri | http://hdl.handle.net/2117/8171 |
dc.description.abstract | Let T be a tree with m edges. A well-known conjecture of Ringel states that T decomposes the complete graph $K_{2m+1}$. Graham and Häggkvist conjectured that T also decomposes the complete bipartite graph $K_{m,m}$. In this paper we show that there exists an integer n with n ≤[(3m - 1)/2] and a tree T₁ with n edges such that T₁ decomposes $K_{2n+1}$ and contains T. We also show that there exists an integer n' with n' ≥ 2m-1 and a tree T₂ with n' edges such that T₂ decomposes $K_{n',n'}$and contains T. In the latter case, we can improve the bound if there exists a prime p such that [3m/2] ≤ p < 2m - 1. |
dc.format.extent | 5 p. |
dc.language.iso | eng |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs |
dc.subject.lcsh | Graph labelings |
dc.subject.lcsh | Graph theory |
dc.title | Every tree is a large subtree of a tree that decomposes Kn or Kn,n |
dc.type | Article |
dc.subject.lemac | Grafs, Teoria de |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.identifier.doi | 10.1016/j.disc.2009.09.021 |
dc.relation.publisherversion | http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6V00-4XC3X9H-2-1&_cdi=5632&_user=1517299&_pii=S0012365X09004579&_orig=search&_coverDate=02%2F28%2F2010&_sk=996899995&view=c&wchp=dGLzVzz-zSkzV&md5=98710dd3d16287525c6ab44b995a34f3&ie=/sdarticle.pdf |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 2182424 |
dc.description.version | Postprint (published version) |
local.citation.author | Llado, A.; López, S.C.; Moragas, J. |
local.citation.publicationName | Discrete mathematics |
local.citation.volume | 310 |
local.citation.number | 4 |
local.citation.startingPage | 838 |
local.citation.endingPage | 842 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [3.261]
-
Articles de revista [290]