Jonathan Tidor

Many problems in discrete geometry can be conveniently encoded by a structure known as a semialgebraic graph. These problems include the Erdős unit distance problem and many of its variants, point-line incidence problems studied by Szemerédi–Trotter...

The degeneracy of a graph is a measure of sparseness that gives important information about its Ramsey- and Turán-type properties. I will talk about the hypergraph extension of these problems. The typical notion of hypergraph degeneracy does not give...