Abstract
It is shown that there is a digraphD of minimum outdegree 12m and\(\mathop {\max }\limits_{x \ne y} \) μ(x, y; D)=11m, but every digraphD of minimum outdegreen contains verticesx ≠y withλ(x, y; D)≧n−1, whereμ(x, y; D) andλ(x, y; D) denote the maximum number of openly disjoint and edge-disjoint paths, respectively.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. P. Gupta, On flows in pseudosymmetric networks,J. Siam Appl. Math. 14 (1966), 215–225.
R. Halin,Graphentheorie I, Wissenschaftliche Buchgesellschaft, Darmstadt 1980.
Y. O. Hamidoune, An application of connectivity theory in graphs to factorizations of elements in groups,Europ. J. Combinatorics 2 (1981), 349–355.
L. Lovász, Connectivity in digraphs,J. Combinatorial Theory (B) 15 (1973), 174–177.
W. Mader, Existenzn-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte,Abh. Math. Sem. Universität Hamburg 37 (1972), 86–97.
W. Mader, Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind,Math. Nachr. 53 (1972), 145–150.
W. Mader, Grad und lokaler Zusammenhang in endlichen Graphen,Math. Ann. 205 (1973), 9–11.
L. Mirsky,Transversal theory, New York, London, Academic Press 1971.
C. Thomassen, Even cycles in directed graphs,to appear in European Journal of Combinatorics.