Equivalence of seven major theorems in combinatorics
Robert David Borgersen · 2004
The seven following theorems, while seemingly unrelated, are equivalent (i.e., any one of them may be proved by assuming any other is true). These theorems relate to graph theory, set the-ory, flow theory, and even marriage: Menger’s theorem (1929), König’s theorem for matrices (1931), the König-Egerváry theo-