Whitney inequalities for graph connectivity

For every nontrivial graph, $\kappa (G)\le \lambda (G)\le \delta (G)$.

These compare two numerical invariants of connectivity with the minimum degree of a graph.

Two large cliques joined by a bipartite cross graph with edge count $\ell$ and vertex-cover number $k$ realize edge connectivity $\ell$ and vertex connectivity $k$ while preserving a chosen minimum degree.