Rooted minor problems in highly connected graphs (Q1886348)

A graph is said to have a rooted complete bipartite minor \(K_{a,k}\) if for every \(k\) distinct vertices \(v_1,\dots,v_k\) there are disjoint connected subgraphs \(H_1,\dots, H_a, K_1,\dots, K_k\) such that each of the \(K_i\) contains \(v_i\) and is adjacent to all \(H_1,\dots,H_a\). The author derives connectivity conditions for the existence of rooted complete bipartite minors from some known and deep connectivity or average degree conditions for the existence of (non-rooted) complete bipartite minors. Among others it is proved that for every \(a\) there is a constant \(N(a)\) such that every \(25k\)-connected graph of order at least \(N(a)\) has a rooted complete bipartite minor \(K_{a,k}\).