Matsuda–Ozeki–Yamashita's branch-vertex conjecture for claw-free graphs
Let be a non-negative integer and let be a connected claw-free graph of order . For an integer , let be the minimum degree sum of an independent set of vertices in :
A vertex of degree at least three in a tree is called a branch vertex. Matsuda–Ozeki–Yamashita's conjecture. Let be a non-negative integer and let be a connected claw-free graph of order . If
then has a spanning tree with at most branch vertices. This conjecture proposes a sharper degree-sum condition for spanning trees with boundedly many branch vertices in connected claw-free graphs, improving on earlier sufficient conditions. The supplied text does not state whether the conjecture has been resolved.
References
- Pham Hoang Ha and Dang Dinh Hanh, “Spanning trees with at most 2 branch vertices in claw - free graphs”, arXiv:1806.00734 (2018).
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.