Corpus ID: 11107798

A Min Flow Max Cut Theorem

  title={A Min Flow Max Cut Theorem},
  author={A. Kitchen},
Consider a network of pipes joining a set of intakes (the source) to a separate set of outlets (the e n sink), so that liquid flows from the intakes, through the network, to the outlets. A cross-section of th etwork, separating the intakes on one side from the outlets on the other, is called a cut. A minimal t c cut is one that, roughly speaking, slices through a set of pipes whose combined capacity is minimal. I an be shown that if we attempt to force as much liquid as possible through the… Expand


Decomposing Partial Orders into Chains
  • Journal of Combinatorial Theory,
  • 1950