Nóra Frankl

collaborators

3 papers

math.CO2025

On forbidden configurations in point-line incidence graphs

Martin Balko, NÃ³ra Frankl

The celebrated SzemerÃ©di--Trotter theorem states that the maximum number of incidences between $n$ points and $n$ lines in the plane is $O (n^{4/3})$ , which is asymptotically tight…

math.CO2025

Generalised ErdÅs distance theory on graphs

Sean Dewar, Nora Frankl, Samuel Mansfield +3

The famous ErdÅs distinct distances problem asks the following: how many distinct distances must exist between a set of $n$ points in the plane? There are many generalisations of…

math.CO2025

Monochromatic configurations on a circle

GÃ¡bor DamÃ¡sdi, NÃ³ra Frankl, JÃ¡nos Pach +1

If we two-colour a circle, we can always find an inscribed triangle with angles $(\frac{I ¨}{} 7, \frac{2 I ¨ }{7}, \frac{4 I ¨ }{7})$ whose three vertices have the same colour. In fact, Bialo…

On forbidden configurations in point-line incidence graphs

Generalised ErdÅs distance theory on graphs

Monochromatic configurations on a circle

Generalised ErdÅs distance theory on graphs