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

Showing 2020Show all

10 papers · 1 filter

math.CO2020

Trivial colors in colorings of Kneser graphs

Sergei Kiselev, Andrey Kupavskii

We show that any proper coloring of a Kneser graph $K G_{n, k}$ with $n - 2 k + 2$ colors contains a trivial color (i.e., a color consisting of sets that all contain a fixed element), pro…

math.CO2020

The extremal number of surfaces

Andrey Kupavskii, Alexandr Polyanskii, István Tomon +1

In 1973, Brown, Erdős and Sós proved that if $H$ is a 3-uniform hypergraph on $n$ vertices which contains no triangulation of the sphere, then $H$ has at most $…

math.CO2020

Intersection theorems for triangles

Peter Frankl, Andreas Holmsen, Andrey Kupavskii

Given a family of sets on the plane, we say that the family is intersecting if for any two sets from the family their interiors intersect. In this paper, we study intersecting fami…

math.CO2020

Binary scalar products

Andrey Kupavskii, Stefan Weltge

Let $A, B \subseteq R^{d}$ both span $R^{d}$ such that $⟨ a, b ⟩ \in {0, 1}$ holds for all $a \in A$ , $b \in B$ . We show that $ |A| \cdot |B| \le (d+1) 2…

math.CO2020★ 12 cited

All finite sets are Ramsey in the maximum norm

Andrey Kupavskii, Arsenii Sagdeev

For two metric spaces $X$ and $Y$ , the chromatic number $χ (X; Y)$ of $X$ with forbidden $Y$ is the smallest $k$ such that there is…

math.CO2020

VC-saturated set systems

Nóra Frankl, Sergei Kiselev, Andrey Kupavskii +1

The well-known Sauer lemma states that a family $F \subseteq 2^{[n]}$ of VC-dimension at most $d$ has size at most $\sum_{i = 0}^{d} (i n)$ . We obtain both random and ex…