Extremal function for rooted $K_5$ minors

Abstract

We show that if an n-vertex 5-connected graph has at least 4n-10 edges, then for any choice of five of its vertices, we can contract disjoint connected subgraphs containing these vertices to obtain $K_5$ as a minor. The bound on the number of edges is the best possible.

85 pages, 6 figures