Tag Archives: Shubhangi Saraf

Incidence Bounds and Interlacing Eigenvalues

The Szemerédi–Trotter theorem is one of the central results in discrete geometry which gives us a (tight) bound on the number of incidences, i.e., the number of point-line pairs with the point lying on the line, between finite sets of points and lines … Continue reading

Posted in Combinatorics, Finite Geometry, Incidence Geometry, Spectral Graph Theory | Tagged , , , , , , | 3 Comments