3 problems

Let $G=(V,E)$ be a graph and let $S$ be a set of terminal pairs with $|S|=2$. The multicut dominant $\textsc{MultC}(G,S)$ is the dominant associated with multicut incidence vectors…

Even-cycle multicut conjecture. The multicut dominant $\textsc{MultC}(C_{2n},S)$ is completely defined by the edge inequalities, the path inequalities, and the inequalities from th…

Let $G=(V,E)$ be a graph, let $S\subseteq\binom{V}{2}$, and let $\widehat{G}$ be obtained from $G$ by replacing an edge by a connected graph. A facet-replacement conjecture asserts…