Decomposing almost complete graphs by random trees
Author:
Open Access
- 1 February 2018
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 154, 406-421
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Ministerio de Economía y Competitividad (MTM2014-60127-P)
This publication has 14 references indexed in Scilit:
- An approximate version of the tree packing conjectureIsrael Journal of Mathematics, 2016
- Almost Every Tree With m Edges Decomposes K2m,2mCombinatorics, Probability and Computing, 2013
- The shape of unlabeled rooted random treesEuropean Journal of Combinatorics, 2010
- Every tree is a large subtree of a tree that decomposes orDiscrete Mathematics, 2010
- On a conjecture of Graham and Häggkvist with the polynomial methodEuropean Journal of Combinatorics, 2009
- -Valuations for some stunted treesDiscrete Mathematics, 2006
- Distinct Sums Modulo n and Tree EmbeddingsCombinatorics, Probability and Computing, 2002
- Additive latin transversalsIsrael Journal of Mathematics, 2000
- The distribution of nodes of given degree in random treesJournal of Graph Theory, 1999
- Combinatorial NullstellensatzCombinatorics, Probability and Computing, 1999