Erdős problem 812

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

Sources

The source's own material, retained exactly.

3 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

812.lean

Retained formal statement1 of 3

Is it true that $\frac{R(n+1)}{R(n)}\geq 1+c$ for some constant $c>0$ , for all large $n$ ?

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

1True ↔2  ∃ c > 0,3    ∀ᶠ (n : ℕ) in Filter.atTop,4      ↑(Combinatorics.hypergraphRamsey 2 (n + 1)) / ↑(Combinatorics.hypergraphRamsey 2 n) ≥ 1 + c

OpenStatement only, no proof