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.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。