2 problems

For a finite graph $G$, let $c_1^+(G)$ denote the supremum of the flow-cut quantity over all nonnegative edge-length functions. For a family $\mathcal{F}$ of finite graphs, define…

For a graph, compare the maximum integer concurrent flow with the sparsest cut; the flow-cut gap is the ratio between these quantities. The integer flow-cut gap conjecture. In mino…