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

9 papers · 1 filter

math.CO2021

On the Erdős-Purdy problem and the Zarankiewitz problem for semialgebraic graphs

Nora Frankl, Andrey Kupavskii

Erdős and Purdy, and later Agarwal and Sharir, conjectured that any set of $n$ points in $R^{d}$ determine at most $C n^{d /2}$ congruent $k$ -simplices for even $d$ . We obtai…

cs.DM2021

On anti-stochastic properties of unlabeled graphs

Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky +1

We study vulnerability of a uniformly distributed random graph to an attack by an adversary who aims for a global change of the distribution while being able to make only a local c…

math.CO2021★ 2 cited

Max-norm Ramsey Theory

Nóra Frankl, Andrey Kupavskii, Arsenii Sagdeev

Given a metric space $M$ that contains at least two points, the chromatic number $χ (R_{\infty}^{n}, M)$ is defined as the minimum number of c…

math.CO2021

Choice number of Kneser graphs

Vera Bulankina, Andrey Kupavskii

In this short note, we show that for any $ε > 0$ and $k < n^{0.5 - ε}$ the choice number of the Kneser graph $K G_{n, k}$ is $Θ (n lo g n)$ .

math.CO2021

On the maximum number of distinct intersections in an intersecting family

Peter Frankl, Sergei Kiselev, Andrey Kupavskii

For $n > 2 k \geq 4$ we consider intersecting families $F$ consisting of $k$ -subsets of ${1, 2, \dots, n}$ . Let $I (F)$ denote the family of all distinc…

math.CO2021

Best possible bounds on the number of distinct differences in intersecting families

Peter Frankl, Sergei Kiselev, Andrey Kupavskii

For a family $F$ , let $D (F)$ stand for the family of all sets that can be expressed as $F ∖ G$ , where $F, G \in F$ . A family $F$ i…