Topic: Vertex and Edge Connectivity and Menger's Theorem

Vertex Splitting for Internally Disjoint Paths

Translating Split-Graph Cuts into Vertex Separators

The Edge Version of Menger’s Theorem

Sharpness Examples for κ ≤ λ ≤ δ

Residual Reachability as a Minimum-Cut Certificate

Proof of Vertex Menger by Vertex Splitting

Proof of Edge Menger by Augmenting Paths

Path-Packings and Separators as Menger Certificates

Minimum Degree as a Connectivity Bound

Measuring Network Resilience with Connectivity