Erdős Problem 20

References:

• erdosproblems.com/20
• Wikipedia

noncomputable def Erdos20.f (n k : ℕ) : ℕ

Let $f(n,k)$ be minimal such that every $F$ family of $n$-uniform sets with $|F| \ge f(n,k)$ contains a $k$-sunflower.

Equations

• Erdos20.f n k = sInf {m : ℕ | ∀ {α : Type} (F : Set (Set α)), (∀ f ∈ F, f.ncard = n) ∧ m ≤ F.ncard → ∃ S ⊆ F, S.ncard = k ∧ IsSunflower S}

theorem Erdos20.f_0_1 : f 0 1 = 1

theorem Erdos20.erdos_20 : True ↔ ∃ (c : ℕ → ℕ), ∀ (n k : ℕ), n > 0 → f n k < c k ^ n

Is it true that $f(n,k) < c_k^n$ for some constant $c_k>0$ and for all $n > 0$?