Add to ORKGEdmonds' fundamental theorem on arborescences [4] characterizes the exis-tence of k pairwise edge-disjoint arborescences with the same root in a directed graph. In [9], Lovász gave an elegant alternative proof which became the base of many extensions of Edmonds' result. In this paper, we use a modification of Lovász' method to prove a theorem on covering intersecting bi-set families under matroid constraints. Our result can be considered as a common generalization of previous results on packing arborescences
AbstractLet G be a finite directed graph, and s a specified vertex in G, such that the edge set of G...
AbstractWe derive a new min-max formula for the minimum number of new edges to be added to a given d...
In this paper, we introduce the concept of b-branchings in digraphs, which is a generalization of br...
Edmonds\u27s fundamental theorem on arborescences in [J. Edmonds, Edge-disjoint branchings, in Combi...
International audienceEdmonds' arborescence packing theorem characterizes directed graphs that have ...
In [7], Edmonds proved a fundamental theorem on packing arborescences that has become the base of se...
We provide the directed counterpart of a slight extension of Katoh and Tanigawa’s result [8] on root...
A common generalization of earlier results on arborescence packing and the covering of intersecting ...
International audienceEdmonds (1973) characterized the condition for the existence of a packing of s...
AbstractWe present an algorithm that finds the edge connectivity λ of a graph having n vectices and ...
AbstractWe establish a common generalization of a theorem of Edmonds on the number of disjoint branc...
The notion of connectivity is fundamental in graph theory. We study thoroughly a recent development ...
AbstractThe well-known spanning tree packing theorem of Nash-Williams and Tutte characterizes graphs...
La notion de connexité est fondamentale en théorie des graphes. Nous proposons une étude approfondie...
AbstractWe disprove the following conjecture of Füredi and Seymour:Conjecture. If F is an intersecti...
AbstractLet G be a finite directed graph, and s a specified vertex in G, such that the edge set of G...
AbstractWe derive a new min-max formula for the minimum number of new edges to be added to a given d...
In this paper, we introduce the concept of b-branchings in digraphs, which is a generalization of br...
Edmonds\u27s fundamental theorem on arborescences in [J. Edmonds, Edge-disjoint branchings, in Combi...
International audienceEdmonds' arborescence packing theorem characterizes directed graphs that have ...
In [7], Edmonds proved a fundamental theorem on packing arborescences that has become the base of se...
We provide the directed counterpart of a slight extension of Katoh and Tanigawa’s result [8] on root...
A common generalization of earlier results on arborescence packing and the covering of intersecting ...
International audienceEdmonds (1973) characterized the condition for the existence of a packing of s...
AbstractWe present an algorithm that finds the edge connectivity λ of a graph having n vectices and ...
AbstractWe establish a common generalization of a theorem of Edmonds on the number of disjoint branc...
The notion of connectivity is fundamental in graph theory. We study thoroughly a recent development ...
AbstractThe well-known spanning tree packing theorem of Nash-Williams and Tutte characterizes graphs...
La notion de connexité est fondamentale en théorie des graphes. Nous proposons une étude approfondie...
AbstractWe disprove the following conjecture of Füredi and Seymour:Conjecture. If F is an intersecti...
AbstractLet G be a finite directed graph, and s a specified vertex in G, such that the edge set of G...
AbstractWe derive a new min-max formula for the minimum number of new edges to be added to a given d...
In this paper, we introduce the concept of b-branchings in digraphs, which is a generalization of br...