The even-degree intersection conjecture for partition path polytopes
Statement
Let be a graph with terminal set , and let denote the polytope associated with a partition of . A vector is -feasible when it is feasible for paths between the parts prescribed by partitions and of . Even-degree intersection conjecture. If all degrees of are even, then for any two partitions and of , every vertex of
is -feasible; equivalently,
is the convex hull of the -feasible vectors. The conjecture would make it possible to optimize arbitrary objective functions over -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.