2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/168651The "minor crossing number" of a graph $G$ is the minimum crossing number of a graph that contains $G$ as a minor. It is proved that for every graph $H$ there is a constant $c$, such that every graph $G$ with no $H$-minor has minor crossing number at most $c|V(G)|$.Combinatorics05C62; 05C10, 05C83text