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

3 papers · 1 filter

math.CO2023

Intersection theorems for uniform subfamilies of hereditary families

Andrey Kupavskii

A family $C$ of sets is hereditary if whenever $A \in C$ and $B \subset A$ , we have $B \in C$ . Chvátal conjectured that the largest intersecting subfamily o…

math.CO2023

Octopuses in the Boolean cube: families with pairwise small intersections, part II

Andrey Kupavskii, Fedor Noskov

The problem we consider originally arises from 2-level polytope theory. This class of polytopes generalizes a number of other polytope families. One of the important questions in t…

math.CO2023

Tilings of $Z$ with multisets of distances

Andrey Kupavskii, Elizaveta Popova

In this paper, we study tilings of $Z$ , that is, coverings of $Z$ by disjoint sets (tiles). Let $T = {d_{1}, \dots, d_{s}}$ be a given multiset of distances. Is it alwa…

Intersection theorems for uniform subfamilies of hereditary families

Octopuses in the Boolean cube: families with pairwise small intersections, part II

Tilings of Z with multisets of distances

Tilings of $Z$ with multisets of distances