If G is a 3-regular graph, then κ(G) = κ'(G)
其中κ(G)是G的connectivity, κ'(G)是G的edge-connectivity
一般的證明課本上有，
可是有個習題問如何用menger's theorem證明，
想了好久都想嘸，懇請高手賜教。
Menger's theorem:
If x, y are vertices of a graph G and xy don't belong to E(G), then the
minimum size of an x, y-cut equals the maximum number of pairwise disjoint x,
y-paths.
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.114.217.84