Exact results and the structure of extremal families for the Duke--Erd\H{o}s forbidden sunflower problem

TL;DR

This paper provides exact solutions and structural insights into the Duke--Erdős sunflower problem for specific parameters, advancing understanding of extremal families and their relation to the Erdős--Rado problem.

Contribution

It offers the first exact extremal results for certain parameters of the Duke--Erdős problem and establishes a structural connection to the Erdős--Rado problem.

Findings

Exact extremal size for t=2, odd s, large k and n.

A stability result for the Duke--Erdős problem.

Reduction of the problem to an Erdős--Rado-like problem.

Abstract

In 1977, Duke and Erd\H{o}s asked the following general question: What is the largest size of a family $\mathtt{F} \subset \binom{[n]}{k}$ that does not contain a sunflower with $s$ petals and core of size exactly $t - 1$? This problem is closely related to the famous Erd\H{o}s--Rado sunflower problem of determining the size $\phi(s,t)$ of the largest $t$-uniform family with no $s$-sunflower. In this paper, we answer this question exactly for $t=2$, odd $s$ and $k\ge 5$, provided $n$ is large enough. Previously, the only know exact extremal result on this problem was due to Chung and Frankl from 1987. One of the important ingredients for the proof that we obtained is a stability result for the Duke--Erd\H{o}s problem, which was previously not known, mostly due to our lack of understanding of the behaviour of $\phi(s,t)$. For large $k$ and $n$ we in fact manage to reduce the Duke--Erd\H{o}s problem to an Erd\H{o}s--Rado-like problem which depends on $t$ and $s$ only. In particular, we get a good understanding of the structure of extremal families for the Duke--Erd\H{o}s problem in terms of the Erd\H{o}s--Rado problem. Previously, a much looser variant of this connection (only in terms of the sizes, rather than the structure, of respective extremal families) was established in a seminal work of Frankl and F\"uredi from 1987.