Linear and matrix generalizations of some combinatorial min-max theorems

We review known linear and matrix generalizations of Hall’s classic ``marriage theorem’’ and Kőnig’s theorem on partial matchings in bipartite graphs, and relate them to linear and matrix generalizations of Dilworth’s theorem about chains and antichains in posets and Menger’s theorem about disjoint paths in directed graphs.