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 2019Show all

5 papers · 1 filter

math.CO2019

Almost-monochromatic sets and the chromatic number of the plane

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

In a colouring of $R^{d}$ a pair $(S, s_{0})$ with $S \subseteq R^{d}$ and with $s_{0} \in S$ is \emph{almost monochromatic} if $S ∖ {s_{0}}$ is monochromatic but $S$ …

math.CO2019

Almost sharp bounds on the number of discrete chains in the plane

Nora Frankl, Andrey Kupavskii

The following generalisation of the Erdős unit distance problem was recently suggested by Palsson, Senger and Sheffer. Given $k$ positive real numbers $δ_{1}, \dots, δ_{k}$ , a $(k + 1)$ -tu…

math.CO2019

Nearly $k$ -distance sets

Nóra Frankl, Andrey Kupavskii

We say that a set of points $S \subset R^{d}$ is an $ε$ -nearly $k$ -distance set if there exist $1 \leq t_{1} \leq \dots \leq t_{k},$ such that the distance between any two d…

math.CO2019

Partitioning infinite hypergraphs into few monochromatic Berge-paths

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

Extending a result of Rado to hypergraphs, we prove that for all $s, k, t \in N$ with $k \geq t \geq 2$ , the vertices of every $r = s (k - t + 1)$ -edge-coloured countably infin…

math.CO2019★ 10 cited

Partitioning edge-coloured hypergraphs into few monochromatic tight cycles

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

Confirming a conjecture of Gyárfás, we prove that, for all natural numbers $k$ and $r$ , the vertices of every $r$ -edge-coloured complete $k$ -uniform hypergraph can be partitioned i…

Almost-monochromatic sets and the chromatic number of the plane

Almost sharp bounds on the number of discrete chains in the plane

Nearly k-distance sets

Partitioning infinite hypergraphs into few monochromatic Berge-paths

Partitioning edge-coloured hypergraphs into few monochromatic tight cycles

Nearly $k$ -distance sets