On packing spanning arborescences with matroid constraint

DOI10.1016/j.endm.2017.06.073zbMath1378.05021OpenAlexW2744768237MaRDI QIDQ1689956

Shin-ichi Tanigawa, Quentin Fortier, Zoltán Szigeti, Csaba Király

Publication date: 18 January 2018

Full work available at URL: https://ir.cwi.nl/pub/26563

zbMATH Keywords

connectivitymatroidEdmonds' branching theorempacking arborescences

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (1)

Packing of arborescences with matroid constraints via matroid intersection

Cites Work

• Unnamed Item
• Arc-disjoint in-trees in directed graphs
• Covering Intersecting Bi-set Families under Matroid Constraints
• Matroid-Based Packing of Arborescences

This page was built for publication: On packing spanning arborescences with matroid constraint