If a graph embeds in the torus or the projective plane if there is an upper bound on the number of edge crossings it has in the plane.