We show that if a graph admits a packing and a covering both consisting of λ many spanning trees, where λ is some infinite cardinal, then the graph also admits a decomposition into λ many spanning trees. For finite λ the analogous question remains open, however, a slightly weaker statement is proved.
ASJC Scopus subject areas
- !!Theoretical Computer Science
- !!Discrete Mathematics and Combinatorics
- !!Computational Theory and Mathematics