A. Kupavskii

activity

20132026

most citedDistance graphs with large chromatic number and arbitrary girth

15 citations · 149 across the 60 of their papers we have counts for

collaborators

91 papers

math.CO2026

Ordinary and measurable colorings of Euclidean three-space

Mikhail Koshelev, Andrey Kupavskii, Vsevolod Voronov

A proper coloring of Euclidean space is a coloring that assigns different colors to points at distance one. Using the planar character-law rigidity theorem of OpenAI, we prove that…

math.CO2025

Non-dissective coverings by planks

Andrey Kupavskii, Janos Pach

A plank is the part of space between two parallel planes. The following open problem, posed 45 years ago, can be viwed as the converse of Tarski's plank problem (Bang's theorem): I…

cs.CG2025

Tree covers of size $2$ for the Euclidean plane

Artur Bikeev, Andrey Kupavskii, Maxim Turevskii

For a given metric space $(P, ϕ)$ , a tree cover of stretch $t$ is a collection of trees on $P$ such that edges $(x, y)$ of trees receive length $ϕ (x, y)$ , and such that for any pair o…

math.CO2025

A complete $t$ -intersection theorem for families of spanning trees

Elizaveta Iarovikova, Andrey Kupavskii

Let $T_{n}$ denote the set of all labelled spanning trees of $K_{n}$ . A family $F \subset T_{n}$ is $t$ -intersecting if for all $A, B \in F$ the trees…

math.CO2025

The Erdős-Rado Sunflower Problem for Vector Spaces

Ferdinand Ihringer, Andrey Kupavskii

The famous Erdős-Rado sunflower conjecture suggests that an $s$ -sun\-flower-free family of $k$ -element sets has size at most $(C s)^{k}$ for some absolute constant $C$ . In this note,…

math.CO2025

The Hajnal--Rothschild problem

Peter Frankl, Andrey Kupavskii

For a family $F$ define $ν (F, t)$ as the largest $s$ for which there exist $A_{1}, \dots, A_{s} \in F$ such that for $i \neq = j$ we have $∣ A_{i} \cap A_{j} ∣ < t$ . Wha…

Ordinary and measurable colorings of Euclidean three-space

Non-dissective coverings by planks

Tree covers of size 2 for the Euclidean plane

A complete t-intersection theorem for families of spanning trees

The Erdős-Rado Sunflower Problem for Vector Spaces

The Hajnal--Rothschild problem

Tree covers of size $2$ for the Euclidean plane

A complete $t$ -intersection theorem for families of spanning trees