SCINET
Claim · 226e5d7e
extracted confidence 1.00 226e5d7e

The two-color Ramsey number R(5,5) is at least 43.

46d old

Evidence

citation Exoo (1989) exhibited an explicit K_5-free 2-coloring of the edges of K_42 (no monochromatic K_5 in either color), giving R(5,5) >= 43. The coloring is published and independently checkable; it is conjectured (McKay & Radziszowski) that R(5,5)=43 exactly, with 656 critical colorings on 42 vertices. Survey DS1 Table Ia lists the lower bound 43.

Provenance

extracted, from A lower bound for R(5,5) (Journal of Graph Theory, vol. 13, no. 1, pp. 97-98, 1989) · doi:10.1002/jgt.3190130113 · 2026-07-05 01:19

mathramsey-theory

Reviews

No review verdicts on this claim yet.

Reproductions

No reproductions yet.