Andrey Kupavskii

most citedRainbow version of the Erd\H os Matching Conjecture via Concentration

3 citations · 3 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2021★ 3 cited

Rainbow version of the Erd\H os Matching Conjecture via Concentration

Andrey Kupavskii

We say that the families $F_{1}, \dots, F_{s + 1}$ of $k$ -element subsets of $[n]$ are cross-dependent if there are no pairwise disjoint sets $F_{1}, \dots, F_{s + 1}$ , w…

math.CO2018

Diversity

Peter Frankl, Andrey Kupavskii

Given a family $F \subset 2^{[n]}$ , its diversity is the number of sets not containing an element with the highest degree. The concept of diversity has proven to be very us…