High connectivity keeping sets in graphs and digraphs Original Research Article

We survey results and possible results of the following type: given positive integers image is there an integer image so that every n-connected, finite graph (digraph) G of order at least image contains a set W of exactly k vertices so that image is image-connected? For digraphs, these question have not really been studied before, so almost all problems are open.