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.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。