Crossing numbers of dense graphs on surfaces

Alfredo Hubard, Arnaud de Mesmay, Hugo Parlier

In this paper, we provide upper and lower bounds on the crossing numbers of dense graphs on surfaces, which match up to constant factors. First, we prove that if $G$ is a dense eno…