On a Frankl-Wilson Theorem
AA Sagdeev - Problems of Information Transmission, 2019 - Springer
We derive an analog of the Frankl-Wilson theorem on independence numbers of some
distance graphs. The obtained results are applied to the problem of the chromatic number of …
distance graphs. The obtained results are applied to the problem of the chromatic number of …
Об одной теореме Франкла–Уилсона
АА Сагдеев - Проблемы передачи информации, 2019 - mathnet.ru
Получен аналог теоремы Франкла–Уилсона о числах независимости некоторых
дистанционных графов. Полученные результаты применены к задаче о …
дистанционных графов. Полученные результаты применены к задаче о …
Nearly equal distances in the plane, II
P Erdős, E Makai Jr, J Pach - arXiv preprint arXiv:2112.08852, 2021 - arxiv.org
Let $\{p_1,\ldots, p_n\}\subset {\Bbb {R}}^ 2$ be a separated point set, ie, any two points
have a distance at least $1 $. Let $ k\ge 1$ be an integer, and $1\le t_1<\ldots< t_k $ be real …
have a distance at least $1 $. Let $ k\ge 1$ be an integer, and $1\le t_1<\ldots< t_k $ be real …
Nearly k-Distance Sets
N Frankl, A Kupavskii - Discrete & Computational Geometry, 2023 - Springer
We say that a set of points S⊂ R d is an ε-nearly k-distance set if there exist 1≤ t 1≤…≤ tk,
such that the distance between any two distinct points in S falls into [t 1, t 1+ ε]∪⋯∪[tk, tk+ ε] …
such that the distance between any two distinct points in S falls into [t 1, t 1+ ε]∪⋯∪[tk, tk+ ε] …