I have observed some similar things between a reformulation of the [Sunflower conjecture](https://en.wikipedia.org/wiki/Sunflower_(mathematics)#Sunflower_lemma_and_conjecture) (see also conjecture 1.3 in _[Improved bounds for the sunflower lemma](https://arxiv.org/abs/1908.08483)_) and [Szemerédi's theorem](https://en.wikipedia.org/wiki/Szemer%C3%A9di%27s_theorem) such that for Szemerédi's theorem we have an often-used equivalent finitary version which states that:

>**Theorem**: for every positive integer $k$ and real number $\delta\in (0,1]$ there exists a positive integer $N=N(\delta,k)$ such that every subset of $\{1,2,\cdots,N\}$ of size at least $δN$ contains an arithmetic progression of length $k$ say $k\text{-arithmetic progression}$

The Sunflower conjecture states that :

>**Conjecture**: Let $r ≥ 3$.  There exists $c = c(r)$  such that any $w$-set system $F$ of size $|F| ≥ c^w$ contains an $r$-sunflower

 We see that both of them investigate about existence of such constant with such size bounds for which we have $k\text{-arithmetic progression}$ or $r$-sunflower. Also, another thing that attracted my attention is that  for [Erdős conjecture on arithmetic progressions](https://en.wikipedia.org/wiki/Erd%C5%91s_conjecture_on_arithmetic_progressions), Erdős and Turán made in 1936 the weaker conjecture that any set of integers with positive natural density contains infinitely many 3-term arithmetic progressions. This was proven by Klaus Roth in 1952, and generalized to arbitrarily long arithmetic progressions by Szemerédi in 1975 in what is now known as Szemerédi's theorem. In the opposite direction,  **Kostochka**  proved that any $w$-set system of size 
$$
|F| \geq 
 cw! \cdot {(\log \log \log w/ \log \log w)}^{w}
$$
must contain a $3$-sunflower for some absolute constant $c$. Now for quantitative bounds of $r_k(N)$(the size of the largest subset of $\{1, 2, \ldots, N \}$ without an arithmetic progression of length $k$) it is an open problem to determine its  exact growth rate. In the same time it is an open problem to determine the exact rate growth or exact bounds for [The sunflower](https://terrytao.wordpress.com/2020/07/20/the-sunflower-lemma-via-shannon-entropy/#more-11852) (the sunflower lemma via Shannon entropy). My question here is:

>**Question**: According to similar things which I have cited above  between the Sunflower conjecture and Szemerédi's theorem, is there any non-trivial relationship between them? And in which context we can consider Sunflower coincide with arithmetic progression?