Editing Max-flow min-cut theorem (section)

==History==
An account of the discovery of the theorem was given by [[L. R. Ford Jr.|Ford]] and [[D. R. Fulkerson|Fulkerson]] in 1962:<ref>[[L. R. Ford Jr.]] & [[D. R. Fulkerson]] (1962) ''Flows in Networks'', page 1, [[Princeton University Press]] {{mr|id=0159700}}</ref>

"Determining a maximal steady state flow from one point to another in a network subject to capacity limitations on arcs ... was posed to the authors in the spring of 1955 by T.E. Harris, who, in conjunction with General F. S. Ross (Ret.) had formulated a simplified model of railway traffic flow, and pinpointed this particular problem as the central one suggested by the model. It was not long after this until the main result, Theorem 5.1, which we call the max-flow min-cut theorem, was conjectured and established.<ref>L. R. Ford Jr. and D. R. Fulkerson (1956) "Maximal flow through a network", [[Canadian Journal of Mathematics]] 8: 399–404</ref> A number of proofs have since appeared."<ref>P. Elias, A. Feinstein, and C. E. Shannon (1956) "A note on the maximum flow through a network", IRE. Transactions on Information Theory, 2(4): 117–119</ref><ref>[[George Dantzig]] and D. R. Fulkerson (1956) "On the Max-Flow MinCut Theorem of Networks", in ''Linear Inequalities'', Ann. Math. Studies, no. 38, Princeton, New Jersey</ref><ref>L. R. Ford & D. R. Fulkerson (1957) "A simple algorithm for finding the maximum network flows and an application to the Hitchcock problem", ''Canadian Journal of Mathematics'' 9: 210–18</ref>