Abstract Mader [J Graph Theory 65 (2010), 61‐69] conjectured that for any tree T of order m,
every k‐connected graph G with minimum degree at least⌊ 3 k/2⌋+ m− 1 contains a subtree …

Mader (2010) conjectured that for any tree T of order m, every k-connected graph G with
minimum degree at least⌊ 3 k 2⌋+ m− 1 contains a subtree T′≅ T such that G− V (T′) is k …

Mader conjectured that for any tree TT of order mm, every kk‐connected graph GG with
minimum degree at least⌊ 3 k 2⌋+ m− 1 ⌊3k2⌋+m-1 contains a subtree T′≅ TT^′≅T …

Mader conjectured that for every positive integer k and finite tree T, every k-connected finite
graph G with minimum degree δ (G)≥⌊ 3 k 2⌋+| T|− 1 contains a subgraph T′≅ T such that …

Mader (2010) conjectured that for every positive integer k and every finite tree T with order
m, every k-connected, finite graph G with δ (G)≥⌊ 3 2 k⌋+ m− 1 contains a subtree T …

Abstract In Mader (2010), Mader conjectured that for every positive integer k and every finite
tree T with order m, every k-connected, finite graph G with δ (G)≥⌊ 3 2 k⌋+ m− 1 contains a …

Mader conjectured in 2010 that for any tree T of order m, every k-connected graph G with
minimum degree at least⌊ 3 k 2⌋+ m-1 contains a subtree T′≅ T such that GV (T′) is k …

A conjecture of Luo, Tian and Wu (2022) says that for every positive integer k and every
finite tree T with bipartition X and Y (denote t= max⁡{| X|,| Y|}), every k-connected bipartite …

We show that for k≤ 2 k≤2 and any tree TT of order mm, every kk‐connected (respectively,
kk‐edge‐connected) graph GG with minimum degree at least max Δ (T)+ k, m− 1 …

We show that one can choose the minimum degree of ak‐connected graph G large enough
(independent of the vertex number of G) such that G contains a copy T of a prescribed tree …