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

3 papers · 1 filter

math.MG2015

From Tarski's plank problem to simultaneous approximation

Andrey B. Kupavskii, János Pach

A {\em slab} (or plank) of width $w$ is a part of the $d$ -dimensional space that lies between two parallel hyperplanes at distance $w$ from each other. It is conjectured that any s…

math.CO2015★ 4 cited

Erd\H os-Ko-Rado theorem for ${0, \pm 1}$ -vectors

Peter Frankl, Andrey Kupavskii

The main object of this paper is to determine the maximum number of ${0, \pm 1}$ -vectors subject to the following condition. All vectors have length $n$ , exactly $k$ of the coordi…

math.CO2015

On random subgraphs of Kneser and Schrijver graphs

Andrey Borisovich Kupavskii

A Kneser graph $K G_{n, k}$ is a graph whose vertices are in one-to-one correspondence with $k$ -element subsets of $[n],$ with two vertices connected if and only if the corresponding…

From Tarski's plank problem to simultaneous approximation

Erd\H os-Ko-Rado theorem for {0,±1}-vectors

On random subgraphs of Kneser and Schrijver graphs

Erd\H os-Ko-Rado theorem for ${0, \pm 1}$ -vectors