On arborescence packing augmentation in hypergraphs

DOI10.1016/J.DISC.2025.114837MaRDI QIDQ6883690zbMATH OpenFDO

Authors Pierre Hoppenot, Zoltán Szigeti

Publication date 16 December 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114837

zbMATH Keywords

arborescenceaugmentationhypergraphspacking

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• Arc‐disjoint arborescences of digraphs
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Connections in combinatorial optimization
• Edge-connectivity augmentation problems
• Edge-connectivity augmentations of~graphs~and~hypergraphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• scientific article; zbMATH DE number 31498 (Why is no real title available?)
• scientific article; zbMATH DE number 3799695 (Why is no real title available?)
• Matroid-rooted packing of arborescences
• Old and new results on packing arborescences in directed hypergraphs
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• On the orientation of graphs and hypergraphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Packing mixed hyperarborescences
• Packing of mixed hyperarborescences with flexible roots via matroid intersection
• Packing of spanning mixed arborescences
• Regular packing of rooted hyperforests with root constraints in hypergraphs
• Supermodularity in unweighted graph optimization. I: Branchings and matchings
• The minimum augmentation of any graph to aK-edge-connected graph
• Zur allgemeinen Kurventheorie.

This page was built for publication: On arborescence packing augmentation in hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883690)