Given a graph , we define to be the minimum value of for which there exists a constant such that every -connected graph with at least vertices contains as a minor. The value of is known to be tied to the vertex cover number , and in fact $\tau(G)\leq …