We propose a further development in the theory of packing arborescences. First we review
some of the existing results on packing arborescences and then we provide common …

Edmonds' arborescence packing theorem characterizes directed graphs that have arc-
disjoint spanning arborescences in terms of connectivity. Later he also observed a …

This paper studies the following packing problem: Given a mixed graph F with vertex set V, a
matroid M on a set S={s 1,…, sk} along with a map π: S→ V, find k mutually edge and arc …

As a generalization of Edmonds' arborescence packing theorem, Kamiyama–Katoh–
Takizawa (2009) provided a good characterization of directed graphs that contain arc …

The problem of matroid-reachability-based packing of arborescences was solved by Kir\'aly.
Here we solve the corresponding decomposition problem that turns out to be more …

Let us be given a rooted digraph D=(V+ s, A) with a designated root vertex s. Edmonds'
seminal result [Edmonds, J., Edge-disjoint branchings, in: B. Rustin (ed.) Combinatorial …

We propose a further development in the theory of packing arborescences. First we review
some of the existing results on packing arborescences and then we provide common …

The fundamental result of Edmonds [5] started the area of packing arborescences and the
great number of recent results shows increasing interest of this subject. Two types of matroid …

A common generalization of earlier results on arborescence packing and the covering of
intersecting bi-set families was presented by the authors in [Bérczi, Király, Kobayashi, 2013] …

As a common generalization of previous arborescence packings, Cs. Király and Szigeti [14]
introduced the reachability-based matroid-restricted packing of arborescences. That paper …