Skip to content

Erdős problem 20

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

Sources

Browse retained paths and inspect the exact material available for this Problem.

3 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

20.lean

Retained formal statement2 of 3

Erdős and Rado [ErRa60] proved the factorial upper bound for the kk-sunflower threshold: any family of nn-uniform sets with more than (k1)nn!(k-1)^n \, n! members contains a kk-sunflower, hence f(n,k)(k1)nn!+1f(n,k) \le (k-1)^n \, n! + 1.

FormalConjectures/ErdosProblems/20.leanErdos20.erdos_20.variants.erdos_rado_bound1 lineExact file
∀ (n k : ℕ), n > 0 → 2 ≤ kErdos20.f n k ≤ (k - 1) ^ n * n.factorial + 1
SolvedStatement only, no proof

Search problems.science

Find a Problem, Result, source, or page