Graph minors and the crossing number of graphs

There are three general lower bound techniques for the crossing numbers of graphs, all of which can be traced back to Leightonʹs work on applications of crossing number in VLSI: the Crossing Lemma, the Bisection Method, and the Embedding Method. In this contribution, we sketch their adaptations to the minor crossing number.