Edge number report 1: State of the art estimates for n ≤ 43
Abstract
This first extracted report contains all lower and upper bounds for e-numbers e(3,k;n), for n ≤ 43, that I know. All but 24 of them are known (exactly).Very little of the proofs is given. A few consequences for upper classical Ramsey number bounds are mentioned.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.