Andrey Kupavskii

collaborators

3 papers

math.CO2026

On supersaturation in the ErdÅs--SÃ³s problem

Andrey Kupavskii, Yakov Shubin

The following classical question in extremal set theory is due to Erd\H os and SÃ³s: what is the size of the largest family $F \subset (k [ n ])$ with no two sets $F_1…

math.CO2025

A complete solution of the ErdÅs-Kleitman matching problem for $n \leq 3 s$

Andrey Kupavskii, Georgy Sokolov

Given integers $n \geq s \geq 2$ , let $e (n, s)$ stand for the maximum size of a family of subsets of an $n$ -element set that contains no $s$ pairwise disjoint members. The study of this…

math.CO2025

Exact results and the structure of extremal families for the Duke--ErdÅs forbidden sunflower problem

Andrey Kupavskii, Fedor Noskov

In 1977, Duke and ErdÅs asked the following general question: What is the largest size of a family $F \subset (k [ n ])$ that does not contain a sunflower with $s$ p…

On supersaturation in the ErdÅs--SÃ³s problem

A complete solution of the ErdÅs-Kleitman matching problem for n≤3s

Exact results and the structure of extremal families for the Duke--ErdÅs forbidden sunflower problem

On supersaturation in the ErdÅs--SÃ³s problem

A complete solution of the ErdÅs-Kleitman matching problem for $n \leq 3 s$

Exact results and the structure of extremal families for the Duke--ErdÅs forbidden sunflower problem