Skip to content

Erdős problem 812

Start work

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

Sources

The source's own material, retained exactly.

3 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

812.lean

Retained formal statement2 of 3

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

FormalConjectures/ErdosProblems/812.leanErdos812.erdos_812.parts.ii3 linesExact file
True ↔  (fun n => ↑n ^ 2) =O[Filter.atTop] fun n =>    ↑(Combinatorics.hypergraphRamsey 2 (n + 1)) - ↑(Combinatorics.hypergraphRamsey 2 n)
OpenStatement only, no proof