Regular packing of rooted hyperforests with root constraints in hypergraphs

The seminal papers of Edmonds (Combinatorial algorithms, Academic Press, New York, 1973), Nash-Williams (J Lond Math Soc 36:445–450, 1961) and Tutte (J Lond Math Soc 36:221–230, 1961) have laid the foundations of the theories of packing arborescences and packing trees. The directed version has been extensively investigated, resulting in a great number of generalizations. In contrast, the undirected version has been marginally considered. The aim of this paper is to further develop the theories of packing trees and forests. Our main result on graphs characterizes the existence of a packing of k forests, \(F_1, \ldots , F_k\) $F_1,\dots ,F_k$ , in a graph G such that each vertex of G belongs to exactly h of the forests, the number of connected components of each \(F_i\) $F_i$ is between \(\ell (i)\) $\ell (i)$ and \(\ell '(i)\) ${\ell }^{\prime }(i)$ and the total number of connected components in the packing is between \(\alpha \) $\alpha$ and \(\beta \) $\beta$ . Finally, we extend this result to hypergraphs and dypergraphs, the latter giving a generalization of a theorem of Bérczi and Frank (Math Oper Res 43(3):726–753, 2018). As a matter of fact, this research was motivated by the paper of Bérczi and Frank (Math Oper Res 43(3):726–753, 2018).