F. Noskov

collaborators

3 papers

math.CO2026

Forbidding just one intersection for short integer sequences

Elizaveta Iarovikova, Fedor Noskov, Georgy Sokolov +1

In this paper, we study the famous ErdÅs--SÃ³s forbidden intersection problem for words over an alphabet of size $m$ : what is the maximal size of a subfamily $F$ of $[m]…

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…

math.CO2025

Linear dependencies, polynomial factors in the Duke--Erd\H os forbidden sunflower problem

Andrey Kupavskii, Fedor Noskov

We call a family of $s$ sets ${F_{1}, \dots, F_{s}}$ a \textit{sunflower with $s$ petals} if, for any distinct $i, j \in [s]$ , one has $F_{i} \cap F_{j} = \cap_{u = 1}^{s} F_{u}$ . The set $…

Forbidding just one intersection for short integer sequences

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

Linear dependencies, polynomial factors in the Duke--Erd\H os forbidden sunflower problem

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