Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths

DOI10.1002/jgt.22001zbMath1350.05050arXiv1705.00471OpenAlexW3124841120MaRDI QIDQ2833123

Attila Joó

Publication date: 16 November 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

packinginfinite digraphbranchingarborescenceEdmonds' branching theorem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Packing Countably Many Branchings with Prescribed Root‐Sets in Infinite Digraphs ⋮ An analogue of Edmonds' branching theorem for infinite digraphs ⋮ Old and new results on packing arborescences in directed hypergraphs

Cites Work

• A note on disjoint arborescences
• Arc-disjoint in-trees in directed graphs
• On two minimax theorems in graph
• Infinite, highly connected digraphs with no two arc-disjoint spanning trees

This page was built for publication: Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths