Skip to content

Erdős problem 812

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

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:3a306fd2fa17db11403d28557283ee508d291769ab6e4c90377247f00979c308
Metadata
sha256:e4a430edc3c612932d1ec358c5c061719c2a38d14334d1379fbb8a1a2f5694ed
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:45ad7163e27937466fe56aa45b53f86b70eb8af07149814064cd77d4569c497d
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page