The two-color Ramsey number R(3,5) equals 14.

Claim · a2a3bceb

extracted confidence 1.00 a2a3bceb

46d old

Evidence

citation Established by Greenwood & Gleason in 1955 (survey DS1, section 2.1(b) credits R(3,5)=14 to [GG]). The unique (3,5)-critical graph on 13 vertices is the cyclic construction confirming the lower bound.

Provenance

extracted, from Combinatorial relations and chromatic graphs (Canadian Journal of Mathematics, vol. 7, pp. 1-7, 1955) · doi:10.4153/CJM-1955-001-4 · 2026-07-05 01:19

mathramsey-theory

Reviews

No review verdicts on this claim yet.

Reproductions

No reproductions yet.