Nóra Frankl

activity

20162023

most citedEmbedding graphs in Euclidean space

12 citations · 35 across the 12 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

math.CO2021

On the Erdős-Purdy problem and the Zarankiewitz problem for semialgebraic graphs

Nora Frankl, Andrey Kupavskii

Erdős and Purdy, and later Agarwal and Sharir, conjectured that any set of $n$ points in $R^{d}$ determine at most $C n^{d /2}$ congruent $k$ -simplices for even $d$ . We obtai…

math.CO2021★ 2 cited

Max-norm Ramsey Theory

Nóra Frankl, Andrey Kupavskii, Arsenii Sagdeev

Given a metric space $M$ that contains at least two points, the chromatic number $χ (R_{\infty}^{n}, M)$ is defined as the minimum number of c…