ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite connected graph, possibly with multiple edges but no loops. A tree TT in GG is weakly even if all leaves of TT that have maximum degree in GG belong to the same part of the bipartition of TT. A tree is spanning if it contains every vertex of GG.

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 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.