The facet-connectedness conjecture for cutsets
The facet-connectedness conjecture for cutsets
Let be a polytope, let be a facet of , and let be a cutset. Facet-connectedness conjecture. The cutset cannot contain vertices and lying in a common facet of unless there exists a connected path from to within . 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
Sign in to submit a solution.
No solutions have been posted yet.