Facet-replacement conjecture for the multicut dominant
Statement
Let be a graph, let , and let be obtained from by replacing an edge by a connected graph. A facet-replacement conjecture asserts that any facet-defining inequality of is either an edge inequality or is obtained from a facet-defining inequality of by applying the edge-replacement operation for paths. This would extend the preceding edge-replacement results and organize the possible facets after replacing edges by connected subgraphs; its resolution is not given here.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.