1 problem

A $k$-quasiplanar graph is a graph that can be drawn in the plane with no $k$ pairwise crossing edges. The linear edge bound conjecture. For any $k>1$, a $k$-quasiplanar graph on…