An analogue of Edmonds' branching theorem for infinite digraphs
From MaRDI portal
Publication:2225436
Abstract: We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whose underlying graphs are trees. Instead we introduce the notion of pseudo-arborescences and prove a corresponding packing result. Finally, we verify some tree-like properties for these objects, but give also an example that their underlying graphs do in general not correspond to topological trees in the Freudenthal compactification of the underlying multigraph of the digraph.
Recommendations
- Edmonds' branching theorem in digraphs without forward-infinite paths
- Packing countably many branchings with prescribed root-sets in infinite digraphs
- Packing branchings under cardinality constraints on their root sets
- The \(b\)-branching problem in digraphs
- Arboricity and tree-packing in locally finite graphs
Cites work
- Arboricity and tree-packing in locally finite graphs
- Digraphs
- Edge-Disjoint Spanning Trees of Finite Graphs
- Edmonds' branching theorem in digraphs without forward-infinite paths
- Extremal infinite graph theory
- Graph theory
- Graph-theoretical versus topological ends of graphs.
- Infinite, highly connected digraphs with no two arc-disjoint spanning trees
- On a packing problem for infinite graphs and independence spaces
- On the Problem of Decomposing a Graph into n Connected Factors
Cited in
(4)
This page was built for publication: An analogue of Edmonds' branching theorem for infinite digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225436)
