ASGT

Lecture 6

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 , we have for every k, the eigenvalue bound

Open question: What about the eigenvalue gaps? I conjecture that the stronger bound holds for every k. I believe it is open even for k=2.

Advertisements