Packing of mixed hyperarborescences with flexible roots via matroid intersection

DOI10.37236/10105zbMath1470.05132arXiv2012.13899OpenAlexW3189040255MaRDI QIDQ2048562

Florian Hoersch, Zoltán Szigeti

Publication date: 9 August 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

mixed graphsarborescencesedge-disjoint spanning trees

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites Work

• 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
• Packing of maximal independent mixed arborescences
• Matroid Intersection
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Packing of mixed hyperarborescences with flexible roots via matroid intersection