Abstract
The theorem to be proved in this note is a generalization of a well-known combinatorial theorem of P. Hall, [4].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. B. Dantzig and D. R. Fulkerson, On the ma.x-flow min-cut theorem of networks,Ann. of Math. Study No. 38, Contributions to linear inequalities and related topics,edited by H. W. Kuhn and A. W. Tucker, 215-221.
L. R. Ford, Jr., and D. R. Fulkerson, Maximal flow through a network,Canad. J. Math. 8 (1956), 399-404.
L. R. Ford, Jr., and D. R. Fulkerson, A simple algorithm for finding maximal network flows aud an application to the Hitchcock problem,Canad. J. Math. 9 (1957), 210-218.
P. Hall. On Representatives of Subsets,J. London Math. Soc, 10 (1935), 26-30.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Birkhäuser Boston, a part of Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Gale, D. (2009). A Theorem on Flows in Networks. In: Gessel, I., Rota, GC. (eds) Classic Papers in Combinatorics. Modern Birkhäuser Classics. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4842-8_17
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4842-8_17
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4841-1
Online ISBN: 978-0-8176-4842-8
eBook Packages: Springer Book Archive