A note on heterogeneous decompositions into spanning trees
Combinatorics
2007-10-27 v1
Abstract
In answer to a question of Eggleton, we prove that the complete multigraph on 5 vertices with edge multiplicity 6, namely , has a decomposition into 5 copies of the family of trees of order 5 and that has a decomposition into 7 copies of the family of trees of order 7. We prove something similar for for .
Keywords
Cite
@article{arxiv.math/0605398,
title = {A note on heterogeneous decompositions into spanning trees},
author = {Adrian Riskin},
journal= {arXiv preprint arXiv:math/0605398},
year = {2007}
}
Comments
3 pages