ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a graph, let S⊆(V2)S\subseteq\binom{V}{2}, and let G^\widehat{G} be obtained from GG by replacing an edge by a connected graph. A facet-replacement conjecture asserts that any facet-defining inequality of \textscMultC(G^,S)\textsc{MultC}(\widehat{G},S) is either an edge inequality or is obtained from a facet-defining inequality of \textscMultC(G,S)\textsc{MultC}(G,S) 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.