Math 2.0

Combinatorics Proposition

Augmenting along a path raises the flow value by delta

Builds on Directed graph

Statement

Let D=(V,E)D = (V, E) be a finite directed graph with a source ss, a sink tt and a capacity function cc on the edges. Let ϕ\phi be a flow of value vv on this network. A flow obeys 0≤ϕ(e)≤c(e)0 \le \phi(e) \le c(e) on each edge, and it is conserved at each vertex other than ss and tt.

Let P=(x0,x1,…,xm)P = (x_0, x_1, \dots, x_m) be an augmenting path from ss to tt. Each step of PP uses an edge of DD either forwards or backwards. A forward edge has spare capacity c(e)−ϕ(e)>0c(e) - \phi(e) > 0. A backward edge carries positive flow ϕ(e)>0\phi(e) > 0. Let δ>0\delta > 0 be the smallest of the spare capacities of the forward edges and the flows of the backward edges on PP.

Define a new function ϕ^\hat\phi as follows. Add δ\delta to ϕ\phi on each forward edge of PP. Subtract δ\delta from ϕ\phi on each backward edge of PP. Leave ϕ\phi unchanged on all other edges.

Then ϕ^\hat\phi is a flow on the network, and its value is v+δv + \delta.

Remarks

The choice of δ\delta keeps every edge value between 00 and its capacity. At each inner vertex of PP the two changes cancel, so conservation still holds. At ss the net outflow grows by exactly δ\delta.

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Directed graph definition
  2. Augmenting along a path raises the flow value by delta statement

Further reading

  1. Web https://github.com/mitchkeller/applied-combinatorics/blob/ebd95d6bd59e23c633c65cf560bcb93efa912aae/source/s_networkflow_augmenting.ptx#L45, source/s_networkflow_augmenting.ptx:45
About this page
Tag7ZPS42F2TE
URIm2://7ZPS42F2TE
Kindstatement, proposition
WritingW1 stated
MSC05C21, 90B10, 90C35
StatusThis copy of the site has no build data. Run m2 status 7ZPS42F2TE.
UsesDirected graph
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.