An analogue of Edmonds' branching theorem for infinite digraphs
From MaRDI portal
Publication:2225436
DOI10.1016/j.ejc.2020.103182zbMath1458.05094arXiv1805.02933OpenAlexW3081148898MaRDI QIDQ2225436
Publication date: 8 February 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.02933
Cites Work
- On a packing problem for infinite graphs and independence spaces
- Graph-theoretical versus topological ends of graphs.
- Extremal infinite graph theory
- Arboricity and tree-packing in locally finite graphs
- Graph Theory
- Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Infinite, highly connected digraphs with no two arc-disjoint spanning trees
- Digraphs
This page was built for publication: An analogue of Edmonds' branching theorem for infinite digraphs