 Branch set of a graph minor

A branch set is a nonempty set of vertices inducing a connected graph used to represent one vertex of a graph minor. A $K_t$ graph minor is equivalent to $t$ disjoint branch sets with at least one edge between every pair. Connectedness allows each set to be reduced to a single vertex by edge contractions.