1 problem

Let $G$ be an $n$-vertex graph, and define its bisection deficit by … where $\operatorname{bw}(G)$ is the minimum number of edges crossing a balanced partition of the vertex set. S…