Network Flow and Systems of Representatives
Network Flow and Systems of Representatives
复制标题
网络流程和代表制度
DOI：
--
复制
发表时间：
1958
期刊：
影响因子：
--
通讯作者：
D. R. Fulkerson
中科院分区：
文献类型：
--
作者：
L. R. Ford;D. R. Fulkerson
为研究网络中的流而发展的理论 (2; 3; 4; 5; 6; 7) 有时为处理某些类型的组合问题提供了有用的工具，如先前在 (3; 4; 6; 7) 中所示。特别是，存在不同代表系统的霍尔型定理，这些代表系统包含一组规定的边际元素 (10; 11)，或者更一般地说，其与基本集合的给定分区的每个成员的交集具有规定的下限和上限 (9) 之间的基数，可以通过这种方式获得 (7)。
The theory developed for the study of flows in networks (2; 3; 4; 5; 6; 7) sometimes provides a useful tool for dealing with certain kinds of combinatorial problems, as has been previously indicated in (3; 4; 6; 7). In particular, Hall-type theorems for the existence of systems of distinct representatives which contain a prescribed set of marginal elements (10; 11), or, more generally, whose intersection with each member of a given partition of the fundamental set has a cardinality between prescribed lower and upper bounds (9), can be obtained in this way (7).