Abstract
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.
Originalsprache | englisch |
---|---|
Seiten (von - bis) | 16-22 |
Seitenumfang | 7 |
Fachzeitschrift | Journal of Combinatorial Theory, Series B |
Jahrgang | 149 |
DOIs | |
Publikationsstatus | Veröffentlicht - 2021 |
ASJC Scopus subject areas
- Theoretische Informatik
- Diskrete Mathematik und Kombinatorik
- Theoretische Informatik und Mathematik