Nóra Frankl

According to our database, Nóra Frankl authored at least 14 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On Helly numbers of exponential lattices.

Gergely Ambrus, Martin Balko, Nóra Frankl, Attila Jung, Márton Naszódi

Eur. J. Comb., February, 2024

The Quantitative Fractional Helly theorem.

Nóra Frankl, Attila Jung, István Tomon

CoRR, 2024

2023

Nearly k-Distance Sets.

Nóra Frankl, Andrey Kupavskii

Discret. Comput. Geom., October, 2023

Almost-Monochromatic Sets and the Chromatic Number of the Plane.

Nóra Frankl, Tamás Hubai, Dömötör Pálvölgyi

Discret. Comput. Geom., October, 2023

2022

Almost Sharp Bounds on the Number of Discrete Chains in the Plane.

Nóra Frankl, Andrey Kupavskii

Comb., December, 2022

VC-saturated set systems.

Nóra Frankl, Sergei Kiselev, Andrey Kupavskii, Balázs Patkós

Eur. J. Comb., 2022

Correction to: Large Equilateral Sets in Subspaces of ℓ _∞ ⁿ of Small Codimension.

Nóra Frankl

Discret. Comput. Geom., 2022

Large Equilateral Sets in Subspaces of ℓ _∞ ⁿ of Small Codimension.

Nóra Frankl

Discret. Comput. Geom., 2022

2021

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

Nóra Frankl, Andrey Kupavskii

CoRR, 2021

2020

Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles.

Sebastián Bustamante, Jan Corsten, Nóra Frankl, Alexey Pokrovskiy, Jozef Skokan

SIAM J. Discret. Math., 2020

Partitioning Infinite Hypergraphs into Few Monochromatic Berge-Paths.

Sebastián Bustamante, Jan Corsten, Nóra Frankl

Graphs Comb., 2020

2018

A note on diameter-Ramsey sets.

Jan Corsten, Nóra Frankl

Eur. J. Comb., 2018

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

Nóra Frankl, Janos Nagy, Márton Naszódi

Discret. Math., 2018

2017

Embedding graphs in Euclidean space.

Nóra Frankl, Andrey Kupavskii, Konrad J. Swanepoel

Electron. Notes Discret. Math., 2017