Notes on Linear Programming: Part XLV A Network-Flow Feasibility Theorem and Combinatorial Applications

An establishment of necessary and sufficient conditions for the existence of a flow in a network (e.g., a railway network) satisfying prescribed bounds on the net flow leaving certain nodes and entering other nodes.