Connectivity keeping paths for k-connected bipartite graphs.

Luo, Tian and Wu [<italic>Discrete Math</italic>. <bold>345</bold>(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′≅T such that κ(G − V (T′)) ≥ k. In the paper, we confirm the conjecture when T is an odd path on m vertices. We remind that Yang and Tian [Proof of a conjecture on connectivity keeping odd paths in k-connected bipartite graphs, arXiv:2209.08373v2] also prove the same result by a different way. [ABSTRACT FROM AUTHOR]