Jackson–Yoshimoto's spanning even tree conjecture for regular nonbipartite graphs
Let be a finite connected graph, possibly with multiple edges but no loops. A spanning tree of is even if all leaves of belong to the same part of the bipartition of . Jackson–Yoshimoto's conjecture. Every regular nonbipartite connected graph has a spanning even tree.
The conjecture asserts the existence of such a tree without the additional 2-factor hypothesis in the partial result preceding it. It is resolved by the paper's result that every connected graph that is not a regular bipartite graph has a spanning weakly even tree; in particular, every regular nonbipartite connected graph has a spanning even tree.
References
2 papers in this index state this conjecture (2024). The statement above is taken from the most recent of them; the others are arXiv:2408.07056.
Source: Jiangdong Ai, M. N. Ellingham, Zhipeng Gao, Yixuan Huang, Xiangzhou Liu, Songling Shan, Simon Špacapan and Jun Yue, “Spanning weakly even trees of graphs”, arXiv:2409.15522 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.