Erdős problem 812 · problems.science

Burr, Erdős, Faudree, and Schelp [BEFS89] proved that $R(n+1)-R(n) \geq 4n-8$ for all $n\geq 2$ .

Sources

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

3 retained statements2415f78e850a

FormalConjectures/ErdosProblems/

812.lean

Retained formal statement3 of 3

Burr, Erdős, Faudree, and Schelp [BEFS89] proved that $R(n+1)-R(n) \geq 4n-8$ for all $n\geq 2$ .

FormalConjectures/ErdosProblems/812.leanErdos812.erdos_812.variants.lower_bound1 lineExact file

1∀ n ≥ 2, ↑(Combinatorics.hypergraphRamsey 2 (n + 1)) - ↑(Combinatorics.hypergraphRamsey 2 n) ≥ 4 * ↑n - 8

SolvedStatement only, no proof