Abstract
The problem of matroid-based packing of arborescences was introduced and solved in Durand de Gevigney et al. (SIAM J Discret Math 27(1):567-574) . Frank (In personal communication) reformulated the problem in an extended framework. We proved in Fortier et al. (J Graph Theory 93(2):230-252) that the problem of matroid-based packing of spanning arborescences is NP-complete in the extended framework. Here we show a characterization of the existence of a matroid-based packing of spanning arborescences in the original framework. This leads us to the introduction of a new problem on packing of arborescences with a new matroid constraint. We characterize mixed graphs having a matroid-rooted, k-regular, (f, g)-bounded packing of mixed arborescences, that is, a packing of mixed arborescences such that their roots form a basis in a given matroid, each vertex belongs to exactly k of them and each vertex v is the root of least f(v) and at most g(v) of them. We also characterize dypergraphs having a matroid-rooted, k-regular, (f, g)-bounded packing of hyperarborescences.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data Availibility Statement
The manuscript has no associated data.
References
Bérczi K, Frank A (2018) Supermodularity in unweighted graph optimization I: branchings and matchings. Math Oper Res 43(3):726–753
Cai MC (1983) Arc-disjoint arborescences of digraphs. J Graph Theory 7:235–240
Durand de Gevigney O, Nguyen VH, Szigeti Z (2013) Matroid-based packing of arborescences. SIAM J Discret Math 27(1):567–574
Edmonds J (1973) Edge-disjoint branchings. In: Rustin B (ed) Combinatorial algorithms. Academic Press, New York, pp 91–96
Fortier Q, Király Cs, Léonard M, Szigeti Z, Talon A (2018) Old and new results on packing arborescences. Discret Appl Math 242:26–33
Fortier Q, Király Cs, Szigeti Z, Tanigawa S (2020) On packing spanning arborescences with matroid constraint. J Graph Theory 93(2):230–252
Frank A (1978) On disjoint trees and arborescences. In: Algebraic methods in graph theory, vol 25, Norh-Holland, Colloquia Mathematica Soc J Bolyai, pp 159–169
Frank A (1984) Generalized polymatroids. In: Hajnal A et al (eds) Finite and infinite sets. North-Holland, Amsterdam-New York, pp 285–294
Frank A (2011) Connections in combinatorial optimization. Oxford University Press, Oxford
Frank A (2013) Personal communication
Frank A, Király T, Király Z (2003) On the orientation of graphs and hypergraphs. Discret Appl Math 131(2):385–400
Gao H (2024) Covering a supermodular-like function in a mixed hypergraph. arxiv: 2402.05458v1
Gao H, Yang D (2021) Packing of spanning mixed arborescences. J Graph Theory 98(2):367–377
Hassin R (1982) Minimum cost flow with set-constraints. Networks 12(1):1–21
Hörsch F, Szigeti Z (2021) Packing of mixed hyperarborescences with flexible roots via matroid intersection. Electron J Combin. https://doi.org/10.37236/10105
Funding
The author declares that no funds, grants, or other support were received during the preparation of this manuscript.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The author has no relevant financial or non-financial interests to disclose.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Szigeti, Z. Matroid-rooted packing of arborescences. J Comb Optim 48, 19 (2024). https://doi.org/10.1007/s10878-024-01219-6
Accepted:
Published:
DOI: https://doi.org/10.1007/s10878-024-01219-6