Local edge-connectivity in regular bipartite graphs (Q1113921)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Local edge-connectivity in regular bipartite graphs |
scientific article; zbMATH DE number 4081602
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local edge-connectivity in regular bipartite graphs |
scientific article; zbMATH DE number 4081602 |
Statements
Local edge-connectivity in regular bipartite graphs (English)
0 references
1988
0 references
\textit{W. Mader} [Grad und lokaler Zusammenhang in endlichen Graphen, Math. Ann. 205, 9-11 (1973; Zbl 0245.05119)] showed that in every graph G there are two distinct vertices \(x,y\in V(G)\) joined by \(\min (d_ G(x),d_ G(y))\) edge-disjoint paths. It is shown here using Menger's theorem that one can fix x arbitrarily in this result as long as G is regular and bipartite.
0 references
regular bipartite graphs
0 references
local connectivity
0 references
Menger's theorem
0 references
