Nóra Frankl

activity

20162023

most citedCoverings: variations on a result of Rogers and on the Epsilon-net theorem of Haussler and Welzl

2 citations · 3 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2023★ 1 cited

Graphs with large minimum degree and no small odd cycles are $3$ -colourable

Julia Böttcher, Nóra Frankl, Domenico Mergoni Cecchelli +2

Answering a question by Letzter and Snyder, we prove that for large enough $k$ any $n$ -vertex graph $G$ with minimum degree at least $\frac{1}{2 k - 1} n$ and without odd cycles of len…

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.MG2016★ 2 cited

Coverings: variations on a result of Rogers and on the Epsilon-net theorem of Haussler and Welzl

Nóra Frankl, János Nagy, Márton Naszódi

We consider four problems. Rogers proved that for any convex body $K$ , we can cover $R^{d}$ by translates of $K$ of density very roughly $d ln d$ . First, we extend this res…

Graphs with large minimum degree and no small odd cycles are 3-colourable

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

Coverings: variations on a result of Rogers and on the Epsilon-net theorem of Haussler and Welzl

Graphs with large minimum degree and no small odd cycles are $3$ -colourable