Jackson–Yoshimoto's spanning weakly even tree conjecture
Statement
Let be a finite connected graph, possibly with multiple edges but no loops. A tree in is weakly even if all leaves of that have maximum degree in belong to the same part of the bipartition of . A tree is spanning if it contains every vertex of .
Jackson–Yoshimoto's conjecture. Every connected graph that is not a regular bipartite graph has a spanning weakly even tree.
This extends the spanning even tree conjecture for regular nonbipartite graphs. The paper's abstract states that this conjecture is confirmed by its main result, so the assertion 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.