Advertisements

Here are the slides, and here’s a proof of the crossing number inequality.

From this paper, we know that for an n-vertex planar graph with maximum degree

**Open question:** What about the eigenvalue gaps? I conjecture that the stronger bound

Advertisements