On the geometric $k$-colored crossing number of $K_n$

Benedikt Hahn, Bettina Klinz, Birgit Vogtenhuber

We study the \emph{geometric $k$-colored crossing number} of complete graphs ${\overline{\overline{\text{cr}}}}_k(K_n)$, which is the smallest number of monochromatic crossings in an…