Thin-tree conjecture for 5-edge-connected planar graphs
Statement
Let an -thin tree in a connected graph be a spanning tree such that, for every cut-set ,
Thin-tree conjecture for 5-edge-connected planar graphs. There exists an such that every -edge-connected planar graph admits two edge-disjoint -thin trees. This is presented as a weaker conjecture implied by a question from the cited work on bounded-diameter forest decompositions; the source discusses a partial resolution of that related question, but does not state that this thin-tree conjecture is solved.
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.