Nóra Frankl

23 papers A* 3Journal 20
YearRankTypeTitle / Venue / Authors
2025 J jnl
Monochromatic Infinite Sets in Minkowski Planes.
Discret. Comput. Geom.
Nóra Frankl, Panna Gehér, Arsenii Sagdeev, Géza Tóth
2025 J jnl
On Forbidden Configurations in Point-Line Incidence Graphs.
SIAM J. Discret. Math.
Martin Balko, Nóra Frankl
2024 J jnl
Max-norm Ramsey theory.
Eur. J. Comb.
Nóra Frankl, Andrey Kupavskii, Arsenii Sagdeev
2024 J jnl
On Helly numbers of exponential lattices.
Eur. J. Comb.
Gergely Ambrus, Martin Balko, Nóra Frankl, Attila Jung, Márton Naszódi
2024 J jnl
On Some Non-Rigid Unit Distance Patterns.
Discret. Comput. Geom.
Nóra Frankl, Dora Woodruff
2024 J jnl
The Quantitative Fractional Helly theorem.
CoRR
Nóra Frankl, Attila Jung, István Tomon
2023 J jnl
Almost-Monochromatic Sets and the Chromatic Number of the Plane.
Discret. Comput. Geom.
Nóra Frankl, Tamás Hubai, Dömötör Pálvölgyi
2023 J jnl
Nearly k-Distance Sets.
Discret. Comput. Geom.
Nóra Frankl, Andrey Kupavskii
2023 A* conf
On Helly Numbers of Exponential Lattices.
SoCG
Gergely Ambrus, Martin Balko, Nóra Frankl, Attila Jung, Márton Naszódi
2022 J jnl
Almost Sharp Bounds on the Number of Discrete Chains in the Plane.
Comb.
Nóra Frankl, Andrey Kupavskii
2022 J jnl
Correction to: Large Equilateral Sets in Subspaces of ℓ
Discret. Comput. Geom.
Nóra Frankl
2022 J jnl
Large Equilateral Sets in Subspaces of ℓ
Discret. Comput. Geom.
Nóra Frankl
2022 J jnl
VC-saturated set systems.
Eur. J. Comb.
Nóra Frankl, Sergei Kiselev, Andrey Kupavskii, Balázs Patkós
2021 J jnl
On the Erdős-Purdy problem and the Zarankiewitz problem for semialgebraic graphs.
CoRR
Nóra Frankl, Andrey Kupavskii
2020 A* conf
Almost Sharp Bounds on the Number of Discrete Chains in the Plane.
SoCG
Nóra Frankl, Andrey Kupavskii
2020 A* conf
Almost-Monochromatic Sets and the Chromatic Number of the Plane.
SoCG
Nóra Frankl, Tamás Hubai, Dömötör Pálvölgyi
2020 J jnl
Embedding graphs in Euclidean space.
J. Comb. Theory A
Nóra Frankl, Andrey Kupavskii, Konrad J. Swanepoel
2020 J jnl
Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles.
SIAM J. Discret. Math.
Sebastián Bustamante, Jan Corsten, Nóra Frankl, Alexey Pokrovskiy, Jozef Skokan
2020 J jnl
Partitioning Infinite Hypergraphs into Few Monochromatic Berge-Paths.
Graphs Comb.
Sebastián Bustamante, Jan Corsten, Nóra Frankl
2019 J jnl
Almost-monochromatic sets and the chromatic number of the plane.
CoRR
Nóra Frankl, Tamás Hubai, Dömötör Pálvölgyi
2018 J jnl
A note on diameter-Ramsey sets.
Eur. J. Comb.
Jan Corsten, Nóra Frankl
2018 J jnl
Coverings: Variations on a result of Rogers and on the Epsilon-net theorem of Haussler and Welzl.
Discret. Math.
Nóra Frankl, Janos Nagy, Márton Naszódi
2017 J jnl
Embedding graphs in Euclidean space.
Electron. Notes Discret. Math.
Nóra Frankl, Andrey Kupavskii, Konrad J. Swanepoel