Removable trees and matchings in $k$-connected and $k$-edge-connected graphs

Adam D. W. Clay, Tibor Jordán

T. Hasunuma (J. Graph Theory, 2023) conjectured that if $G$ is a $k$-connected (resp. $k$-edge-connected) graph with minimum degree $\delta (G)\ge k+m-1$, and $T$ is a tree of order…