×

A mixed version of Menger’s theorem. (English) Zbl 0759.05059

Let be \(G\) a multi(di)graph without loops. Here the authors proved the following common generalization of Menger’s theorem for vertex and edge connectivity: There exists \(\lambda\) edge-disjoint unions of \(n\) internally disjoint \(a,b\)-paths iff for any \(k\), \(0\leq k\leq\min\{n- 1,| V(G)|-2\}\) and for any subset \(X\) of \(V(G)-\{a,b\}\) with cardinality \(k\), \(G-X\) is \(\lambda(n-k)\)-edge-connected between \(a\) and \(b\).
Reviewer: M.Hager (Leonberg)

MSC:

05C40 Connectivity
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] B. Bollob?s: ?Extremal Graph Theory?, Academic Press New York, 1978.
[2] G. Chartrand, andL. Lesniak: ?Graphs & Digraphs? second edition. Wadsworth, Belmont, California, 1986.
[3] G. A. Dirac: In abstrakten Graphen vorhandene vollst?ndige 4-Graphen und ihre Unterleitungen,Math. Nachr. 22 (1960), 61-85. · Zbl 0096.17903 · doi:10.1002/mana.19600220107
[4] R. L. Ford, andD. R. Fulkerson: ?Flows in Networks?, Princeton University Press, New Jersey, 1962. · Zbl 0106.34802
[5] D. K?nig: ?ber Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.Math. Ann. 77 (1916), 453-465. · JFM 46.0146.03 · doi:10.1007/BF01456961
[6] K. Menger: Zur allgemeinen Kurventheorie.Fund. Math. 10 (1927), 96-115. · JFM 53.0561.01
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.