It is proved that for every positive integer
k, every
n-connected graph
G of sufficiently large order contains a set
W of
k vertices such that
G—
W is (
n-2)-connected. It is shown that this does not remain true if we add the condition that
G(
W) is connected.
Mathematics Subject Classification (2000):
05C40 - 05C35