The facet-connectedness conjecture for cutsets

Let PP be a polytope, let FF be a facet of PP, and let CC be a cutset. Facet-connectedness conjecture. The cutset CC cannot contain vertices uu and vv lying in a common facet of FF unless there exists a connected path from uu to vv within CFC\cap F. The source uses this claim in an argument about preserving path lengths under polytope perturbations, but gives no resolution.

Sources & referencesView supporting material

Primary source

Sandeep Koranne and Anand Kulkarni, “Combinatorial Polytope Enumeration”, arXiv:0908.1619 (2009).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.