Recall the capacity scaling argument for Ford-Fulkerson, for example in Kleinberg-Tardos. Is it true or false that for each fixed scaling phase $\Delta$, the bottleneck value for any augmenting path must be in $[\Delta, 2\Delta)$? The lower bound holds trivially, but I'm wondering about the upper...