Old and new results on packing arborescences in directed hypergraphs
From MaRDI portal
Publication:1744239
DOI10.1016/j.dam.2017.11.004zbMath1384.05119OpenAlexW2770437345MaRDI QIDQ1744239
Alexandre Talon, Csaba Király, Zoltán Szigeti, Quentin Fortier, Marion Léonard
Publication date: 20 April 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.11.004
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Hypergraphs (05C65) Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)
Related Items (8)
Reachability in arborescence packings ⋮ Packing of arborescences with matroid constraints via matroid intersection ⋮ Packing of spanning mixed arborescences ⋮ On reachability mixed arborescence packing ⋮ Packing of maximal independent mixed arborescences ⋮ Packing branchings under cardinality constraints on their root sets ⋮ Old and new results on packing arborescences in directed hypergraphs ⋮ Packing of mixed hyperarborescences with flexible roots via matroid intersection
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arc-disjoint in-trees in directed graphs
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- On the orientation of graphs and hypergraphs
- Old and new results on packing arborescences in directed hypergraphs
- Covering Intersecting Bi-set Families under Matroid Constraints
- On Maximal Independent Arborescence Packing
- Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths
- Variations for Lovász’ Submodular Ideas
- Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries
- Matroid-Based Packing of Arborescences
This page was built for publication: Old and new results on packing arborescences in directed hypergraphs
