Hasunuma's conjecture on removable trees in k-connected graphs
All graphs are finite, undirected, and simple. Let , let be a tree of order , and let be a -connected graph. An edge set is deleted from by removing all its edges; in particular, denotes the graph obtained by deleting the edges of a copy of .
Hasunuma's conjecture. If
then contains a copy of such that remains -connected.
Hasunuma proved this for and when is a path; the case was proved independently by Liu, Liu, and Hong and by Yang and Tian. The general conjecture remains open.
References
- Hojin Chu, Ringi Kim and Boram Park, “Minimum degree conditions for removable matchings in k-connected graphs”, arXiv:2607.17533 (2026).
Progress summary
Never refreshed
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.