ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph and let vv be any specified vertex of GG. A collection of spanning trees of GG is independent spanning trees rooted at vv if, for every vertex uu, the paths from vv to uu in the trees are pairwise internally vertex-disjoint. A graph is kk-connected if deleting fewer than kk vertices leaves it connected. Independent spanning trees conjecture. For any k≥2k \geq 2, every kk-connected graph has kk independent spanning trees rooted at any vertex. The conjecture is a foundational strengthening of connectivity via spanning-tree packings. It is known for k≤4k \leq 4 and for planar graphs, but remains open for general k≥5k \geq 5.

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.