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 statement2 of 3

Is it true that $R(n+1)-R(n) \gg n^2$ ?

FormalConjectures/ErdosProblems/812.leanErdos812.erdos_812.parts.ii3 linesExact file

1True ↔2  (fun n => ↑n ^ 2) =O[Filter.atTop] fun n =>3    ↑(Combinatorics.hypergraphRamsey 2 (n + 1)) - ↑(Combinatorics.hypergraphRamsey 2 n)

OpenStatement only, no proof