A Cantor-Bernstein-type theorem for spanning trees in infinite graphs

DOI10.1016/J.JCTB.2021.01.004MaRDI QIDQ2033907zbMATH OpenOpenAlexFDO

Authors Joshua Erde, J. Pascal Gollin, Atilla Joó, Paul Knappe, Max F. Pitz

Publication date 18 June 2021

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1907.09338

zbMATH Keywords

spanning treescoveringpackingcolouring number

Mathematics Subject Classification ID

Infinite graphs (05C63) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: We show that if a graph admits a packing and a covering both consisting of $lambda$ many spanning trees, where $lambda$ is some infinite cardinal, then the graph also admits a decomposition into $lambda$ many spanning trees. For finite $lambda$ the analogous question remains open, however, a slightly weaker statement is proved.

Recommendations

• On spanning tree packings of highly edge connected graphs
• scientific article; zbMATH DE number 1146226
• On end-faithful spanning trees in infinite graphs
• Base partition for mixed families of finitary and cofinitary matroids
• Decompositions of infinite graphs. I: Bond-faithful decompositions

Cites work

• Decomposition of Finite Graphs Into Forests
• Decompositions of infinite graphs. I: Bond-faithful decompositions
• Elementary submodels in infinite combinatorics
• Infinite, highly connected digraphs with no two arc-disjoint spanning trees
• On chromatic number of graphs and set-systems
• On decomposition of graphs
• The colouring number of infinite graphs

Cited in

(8)

• Infinite paths in locally finite graphs and in their spanning trees
• Matrix-tree theorem of digraphs via signless Laplacians
• On spanning tree packings of highly edge connected graphs
• Proof of Halin's normal spanning tree conjecture
• A local injective proof of log-concavity for increasing spanning forests
• Gomory‐Hu trees of infinite graphs with finite total weight
• A Cantor-Bernstein theorem for infinite matroids
• Infinite connected graphs with no end-preserving spanning trees

This page was built for publication: A Cantor-Bernstein-type theorem for spanning trees in infinite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033907)