Finding Large Clique Minors is Hard

Abstract

We prove that it is NP-complete, given a graph G and a parameter h, to determine whether G contains a complete graph K_h as a minor.