ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with terminal set TT, and let Q(G,T)Q(G,\mathcal{T}) denote the polytope associated with a partition T\mathcal{T} of TT. A vector is T1−T2\mathcal{T}_1-\mathcal{T}_2-feasible when it is feasible for paths between the parts prescribed by partitions T1\mathcal{T}_1 and T2\mathcal{T}_2 of TT. Even-degree intersection conjecture. If all degrees of GG are even, then for any two partitions T1\mathcal{T}_1 and T2\mathcal{T}_2 of TT, every vertex of

Q(G,T1)∩Q(G,T2)Q(G,\mathcal{T}_1)\cap Q(G,\mathcal{T}_2)

is T1−T2\mathcal{T}_1-\mathcal{T}_2-feasible; equivalently,

Q(G,T1)∩Q(G,T2)Q(G,\mathcal{T}_1)\cap Q(G,\mathcal{T}_2)

is the convex hull of the T1−T2\mathcal{T}_1-\mathcal{T}_2-feasible vectors. The conjecture would make it possible to optimize arbitrary objective functions over T1−T2\mathcal{T}_1-\mathcal{T}_2-feasible vectors, extending the known result for maximizing the sum of coordinates; the general case is presented as unresolved in the source.

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.