The independent spanning trees conjecture
Statement
Let be a graph and let be any specified vertex of . A collection of spanning trees of is independent spanning trees rooted at if, for every vertex , the paths from to in the trees are pairwise internally vertex-disjoint. A graph is -connected if deleting fewer than vertices leaves it connected. Independent spanning trees conjecture. For any , every -connected graph has independent spanning trees rooted at any vertex. The conjecture is a foundational strengthening of connectivity via spanning-tree packings. It is known for and for planar graphs, but remains open for general .
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.