We show that one can choose the minimum degree of a k-connected graph G large enough (independent of the vertex number of G) such that G contains a copy T of a prescribed tree with the property that G - V(T) remains k-connected. This was conjectured in [W. Mader, J Graph Theory 65 (2010), 61-69].
展开▼
机译：我们表明，可以选择足够大的k个连通图G的最小程度（与G的顶点数无关），以使G包含具有G-V（T）保持k性质的规定树的副本T。 -连接的。这是在[W. Mader，J Graph Theory 65（2010），61-69]。
展开▼
