The vertex-cut version of Menger's theorem also proves that the disconnection number is equivalent to a maximally sized group with a network in which every pair of persons has at least this number of separate paths between them.
Menger's theorem, specifically its vertex-cut version, demonstrates that the disconnection number corresponds to a maximum size group connected by a network where each person can reach any other person through at least this many distinct paths.