The higher-outerplanarity obstruction conjecture for completely independent spanning trees
Statement
A triangulated disc is a plane graph whose bounded faces are triangles, and a graph is -outerplanar if it has a planar embedding whose vertices become empty after repeatedly removing the vertices on the outer face 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 , there exists a 3-connected -outerplanar triangulated disc with no completely independent spanning trees.
The paper constructs such an example for , showing the first case of the proposed obstruction; the assertion for all 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.