Abstract
Recently Kamiyama, Katoh, and Takizawa have shown a theorem on packing arc-disjoint arborescences that is a proper extension of Edmonds’ theorem on disjoint spanning branchings. We show a further extension of their theorem, which makes clear an essential rôle of a reachability condition played in the theorem. The right concept required for the further extension is “convexity” instead of “reachability”.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. Bérczi and A. Frank: Variations for Lovász’ submodular ideas, Technical Report TR-2008-7, The Egerváry Research Group on Combinatorial Optimization (June 2008).
J. Edmonds: Edge-disjoint branchings, in: Combinatorial Algorithms (B. Rustin, ed.), Academic Press, 1973, pp. 91–96.
N. Kamiyama, N. Katoh and A. Takizawa: Arc-disjoint in-trees in directed graphs, Combinatorica29(2) (2009), 197–214.
A. Schrijver: Combinatorial Optimization — Polyhedra and Efficiency, Springer, 2003.