Erdős problem 20
Is it true that for some constant and for all ?
Sources
FormalConjectures/ErdosProblems/
20.lean
Retained formal statement
Erdős and Rado [ErRa60] proved the factorial upper bound for the -sunflower threshold: any family of -uniform sets with more than members contains a -sunflower, hence .
∀ (n k : ℕ), n > 0 → 2 ≤ k → Erdos20.f n k ≤ (k - 1) ^ n * n.factorial + 1SolvedStatement only, no proof