ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A triangulated disc is a plane graph whose bounded faces are triangles, and a graph is kk-outerplanar if it has a planar embedding whose vertices become empty after repeatedly removing the vertices on the outer face kk times. A completely independent spanning tree (CIST) is a spanning tree with the pairwise independence property described in the paper.

Higher-outerplanarity obstruction conjecture. For any k≥4k\geq 4, there exists a 3-connected kk-outerplanar triangulated disc with no completely independent spanning trees.

The paper constructs such an example for k=4k=4, showing the first case of the proposed obstruction; the assertion for all k≥4k\geq4 remains open in the supplied text.

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.