  Luo, Tian and Wu [Discrete Math. 345 (4) (2022) 112788] conjectured that for
any tree $T$ with bipartition $(X,Y)$, every $k$-connected bipartite graph $G$
with minimum degree at least $k+w$, where $w=\max\{|X|,|Y|\}$, contains a tree
$T'\cong T$ such that $\kappa(G-V(T'))\geq k$. In the paper, we confirm the
conjecture for the spider by a new method, where a spider is a tree with at
most one vertex of degree at least three.

Combinatorics