Let $G$ be an undirected graph. For a pair $(x, y)$ of distinct vertices of $G$, let $\mathsf{mincut}(x, y)$ be the least number of edges that should be delted from $G$ so that the resulting graph has no $x-y$ path. Let $a, b, c$ be three vertices in $G$ such that $\mathsf{mincut}(a, b) \leq \mathsf{mincut}(b, c) \leq \mathsf{mincut}(c, a)$. Consider the following possibilities:
Which of the following is TRUE?
64.3k questions
77.9k answers
244k comments
80.0k users