A. Kupavskii

collaborators

3 papers

math.CO2019

Sharp results concerning disjoint cross-intersecting families

Peter Frankl, Andrey Kupavskii

For an $n$ -element set $X$ let $(k X)$ be the collection of all its $k$ -subsets. Two families of sets $A$ and $B$ are called cross-intersecting if $A\cap B…

math.CO2017

Partition-free families of sets

Peter Frankl, Andrey Kupavskii

Let $m (n)$ denote the maximum size of a family of subsets which does not contain two disjoint sets along with their union. In 1968 Kleitman proved that $m(n) = {n\choose m+1}+\ldot…

math.CO2017

Families of vectors without antipodal pairs

Peter Frankl, Andrey Kupavskii

Some Erdős-Ko-Rado type extremal properties of families of vectors from ${- 1, 0, 1}^{n}$ are considered.