Packing Countably Many Branchings with Prescribed Root‐Sets in Infinite Digraphs

DOI10.1002/jgt.22145zbMath1380.05162OpenAlexW2603332409MaRDI QIDQ4604019

Attila Joó

Publication date: 23 February 2018

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

Full work available at URL: https://doi.org/10.1002/jgt.22145

zbMATH Keywords

packinginfinite graphinfinite digraphbranchings

Mathematics Subject Classification ID

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

Related Items (1)

Enlarging vertex-flames in countable digraphs

Cites Work

• Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths
• Infinite, highly connected digraphs with no two arc-disjoint spanning trees
• Highly Connected Infinite Digraphs Without Edge‐Disjoint Back and Forth Paths Between a Certain Vertex Pair
• Flow Networks and Combinatorial Operations Research

This page was built for publication: Packing Countably Many Branchings with Prescribed Root‐Sets in Infinite Digraphs