Large k-preserving sets in infinite graphs

Let K be a cardinal. If K 2 KO, define K ’ : = K . Otherwise, let K ’ : = K + 1. We prove a conjecture of Mader: Every infinite d-connected graph G = (V, E ) contains a set S C Vwith IS1 = IVI such that G\S’ is K-connected for all S’ S.