Authors: Cláudio Carvalho ^1,2; Jonas Costa ^1,2; Raul Lopes ³; Ana Karolinna Maia ^4,1; Nicolas Nisse ^5,6,7,8; Cláudia Sales ^1,2

• 1 Universidade Federal do Ceará = Federal University of Ceará
• 2 Departamento de Computaçãos [Ceará]
• 3 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision
• 4 Departamento de Computaçãos [Ceará]
• 5 Université Côte d'Azur
• 6 Centre National de la Recherche Scientifique
• 7 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis
• 8 Combinatorics, Optimization and Algorithms for Telecommunications

An s-branching flow f in a network N = (D, u), where u is the capacity function, is a flow thatreaches every vertex in V(D) from s while loosing exactly one unit of flow in each vertex other thans. Bang-Jensen and Bessy [TCS, 2014] showed that, when every arc has capacity n − 1, a network Nadmits k arc-disjoint s-branching flows if and only if its associated digraph D contains k arc-disjoints-branchings. Thus a classical result by Edmonds stating that a digraph contains k arc-disjoints-branchings if and only if the indegree of every set X ⊆ V (D) \ {s} is at least k also characterizesthe existence of k arc-disjoint s-branching flows in those networks, suggesting that the larger thecapacities are, the closer an s-branching flow is from simply being an s-branching. This observationis further implied by results by Bang-Jensen et al. [DAM, 2016] showing that there is a polynomialalgorithm to find the flows (if they exist) when every arc has capacity n − c, for every fixed c ≥ 1,and that such an algorithm is unlikely to exist for most other choices of the capacities. In this paper,we investigate how a property that is a natural extension of the characterization by Edmonds’ relatesto the existence of k arc-disjoint s-branching flows in networks. Although this property is alwaysnecessary for the existence of the flows, we show that it is not always sufficient and that it is hardto decide if the desired flows exist even if we know beforehand that the network satisfies it. On thepositive side, we show that it guarantees the existence of the desired flows in some particular casesdepending on the choice of the capacity function or on the structure of the underlying graph of D,for example. We remark that, in those positive cases, polynomial time algorithms to find the flowscan be extracted from the constructive proofs.

• 05C20 - Directed graphs (digraphs), tournaments
• 05C21 - Flows in graphs