Graph Connectivity: the κ ≤ λ ≤ δ Inequality and Menger's Theorem

Vertex connectivity, edge connectivity, and minimum degree obey $\kappa(G)\le\lambda(G)\le\delta(G)$; Menger's theorem recasts connectivity as a max number of disjoint paths, and cubic graphs force $\kappa=\lambda$.