Mostra el registre d'ítem simple
Almost every tree with m edges decomposes K2m,2m
| dc.contributor.author | Drmota, Michael |
| dc.contributor.author | Lladó Sánchez, Ana M. |
| dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV |
| dc.date.accessioned | 2015-07-01T11:06:35Z |
| dc.date.available | 2015-07-02T02:31:46Z |
| dc.date.created | 2014-01 |
| dc.date.issued | 2014-01 |
| dc.identifier.citation | Drmota, M.; Llado, A. Almost every tree with m edges decomposes K2m,2m. "Combinatorics probability and computing", Gener 2014, vol. 23, núm. 1, p. 50-65. |
| dc.identifier.issn | 0963-5483 |
| dc.identifier.uri | http://hdl.handle.net/2117/28488 |
| dc.description.abstract | We show that asymptotically almost surely a tree with m edges decomposes the complete bipartite graph K2m,2m, a result connected to a conjecture of Graham and Häggkvist. The result also implies that asymptotically almost surely a tree with m edges decomposes the complete graph with O(m2) edges. An ingredient of the proof consists in showing that the bipartition classes of the base tree of a random tree have roughly equal size. © Cambridge University Press 2013. |
| dc.format.extent | 16 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 theory |
| dc.subject.other | Bipartition |
| dc.subject.other | Complete bipartite graphs |
| dc.subject.other | Complete graphs |
| dc.subject.other | Equal sizes |
| dc.subject.other | Random tree |
| dc.title | Almost every tree with m edges decomposes K2m,2m |
| 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.1017/S0963548313000485 |
| dc.description.peerreviewed | Peer Reviewed |
| dc.subject.ams | 05C Graph theory |
| dc.relation.publisherversion | http://journals.cambridge.org/action/displayAbstract?aid=9098773 |
| dc.rights.access | Open Access |
| local.identifier.drac | 15043923 |
| dc.description.version | Postprint (author’s final draft) |
| local.citation.author | Drmota, M.; Llado, A. |
| local.citation.publicationName | Combinatorics probability and computing |
| local.citation.volume | 23 |
| local.citation.number | 1 |
| local.citation.startingPage | 50 |
| local.citation.endingPage | 65 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [3.268]
-
Articles de revista [290]