Embedding graphs in Euclidean space N Frankl, A Kupavskii, KJ Swanepoel
Journal of Combinatorial Theory, Series A 171, 105146, 2020
17 2020 Max-norm Ramsey theory N Frankl, A Kupavskii, A Sagdeev
European Journal of Combinatorics 118, 103918, 2024
13 2024 Partitioning edge-colored hypergraphs into few monochromatic tight cycles S Bustamante, J Corsten, N Frankl, A Pokrovskiy, J Skokan
SIAM Journal on Discrete Mathematics 34 (2), 1460-1471, 2020
13 2020 VC-saturated set systems N Frankl, S Kiselev, A Kupavskii, B Patkós
European Journal of Combinatorics 104, 103528, 2022
12 2022 Almost sharp bounds on the number of discrete chains in the plane N Frankl, A Kupavskii
Combinatorica 42 (Suppl 1), 1119-1143, 2022
10 2022 Maximum number of triangle-free edge colourings with five and six colours F Botler, J Corsten, A Dankovics, N Frankl, H Hàn, A Jiménez, J Skokan
Acta Mathematica Universitatis Comenianae 88 (3), 495-499, 2019
10 2019 Coverings: variations on a result of Rogers and on the Epsilon-net theorem of Haussler and Welzl N Frankl, J Nagy, M Naszódi
Discrete Mathematics 341 (3), 863-874, 2018
6 2018 Nearly -distance sets N Frankl, A Kupavskii
arXiv preprint arXiv:1906.02574, 2019
4 2019 Monochromatic infinite sets in Minkowski planes N Frankl, P Gehér, A Sagdeev, G Tóth
arXiv preprint arXiv:2308.08840, 2023
3 2023 Infinite sets can be Ramsey in the Chebyshev metric AB Kupavskii, AA Sagdeev, N Frankl
Uspekhi Matematicheskikh Nauk 77 (3), 175-176, 2022
3 2022 Partitioning infinite hypergraphs into few monochromatic Berge-paths S Bustamante, J Corsten, N Frankl
Graphs and Combinatorics 36 (3), 437-444, 2020
3 2020 Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings N Frankl, A Kupavskii, A Sagdeev
Proceedings of the American Mathematical Society 151 (06), 2353-2362, 2023
2 2023 The Quantitative Fractional Helly theorem N Frankl, A Jung, I Tomon
arXiv preprint arXiv:2402.12268, 2024
1 2024 Almost-monochromatic sets and the chromatic number of the plane N Frankl, T Hubai, D Pálvölgyi
Discrete & Computational Geometry 70 (3), 753-772, 2023
1 2023 Graphs with large minimum degree and no small odd cycles are -colourable J Böttcher, N Frankl, DM Cecchelli, O Parczyk, J Skokan
arXiv preprint arXiv:2302.01875, 2023
1 2023 On the Erd\H {o} s-Purdy problem and the Zarankiewitz problem for semialgebraic graphs N Frankl, A Kupavskii
arXiv preprint arXiv:2112.10245, 2021
1 2021 Large equilateral sets in subspaces of ln∞ of small codimension N Frankl
arXiv preprint arXiv:2005.04256, 2020
1 2020 A note on diameter-Ramsey sets J Corsten, N Frankl
European Journal of Combinatorics 71, 51-54, 2018
1 2018 On Helly numbers of exponential lattices G Ambrus, M Balko, N Frankl, A Jung, M Naszódi
European Journal of Combinatorics 116, 103884, 2024
2024 Nearly k -Distance Sets N Frankl, A Kupavskii
Discrete & Computational Geometry 70 (3), 455-494, 2023
2023