Local edge-connectivity in regular bipartite graphs (Q1113921)

\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.