BASIC DEFINITIONS: crossing pair of curves and common interior point between two arcs. crossing number cr(G) minimum number of crossings in a drawing of G l-grid is a pair two disjoint edge subset E1, E2 ⊂ E of a drawing of a graph G = (V, E), such that |E1| = |E2| = l and every edge in E1 crosses every edge in E2 bi-clique complete bipartite graph where vertex classes differ in size by at most...