← Back to the interactive colourings

Results / From the paper

Lower bounds.
Explicit evidence.

Each construction avoids a blue triangle and a red clique of the prescribed size. A verified graph on t vertices proves R(3,n) ≥ t+1.

These are the results reported in the accompanying paper. They are presented with their certificates and do not constitute a live list of world records.

From the paper
25improved lower bounds
410vertices in the largest construction
8new values in the circulant class
Paper and authors

The constructions

Every bound has
a graph behind it.

The paper improves lower bounds for 25 numbers R(3,n). Each construction comes with a certificate: an explicit graph that can be checked independently.

The paper’s 25 lower bounds

Download results as CSV
Lower bounds for R(3,n) reported in the paper
Ramsey numberVertices in the constructionProven lower boundCertificate
R(3,24)150R(3,24) ≥ 151Certificate ↓
R(3,25)159R(3,25) ≥ 160Certificate ↓
R(3,26)162R(3,26) ≥ 163Certificate ↓
R(3,28)180R(3,28) ≥ 181Certificate ↓
R(3,29)193R(3,29) ≥ 194Certificate ↓
R(3,30)198R(3,30) ≥ 199Certificate ↓
R(3,31)209R(3,31) ≥ 210Certificate ↓
R(3,32)218R(3,32) ≥ 219Certificate ↓
R(3,33)229R(3,33) ≥ 230Certificate ↓
R(3,34)238R(3,34) ≥ 239Certificate ↓
R(3,35)252R(3,35) ≥ 253Certificate ↓
R(3,36)260R(3,36) ≥ 261Certificate ↓
R(3,37)271R(3,37) ≥ 272Certificate ↓
R(3,38)280R(3,38) ≥ 281Certificate ↓
R(3,39)293R(3,39) ≥ 294Certificate ↓
R(3,40)304R(3,40) ≥ 305Certificate ↓
R(3,41)316R(3,41) ≥ 317Certificate ↓
R(3,42)326R(3,42) ≥ 327Certificate ↓
R(3,43)339R(3,43) ≥ 340Certificate ↓
R(3,44)347R(3,44) ≥ 348Certificate ↓
R(3,45)363R(3,45) ≥ 364Certificate ↓
R(3,46)370R(3,46) ≥ 371Certificate ↓
R(3,47)384R(3,47) ≥ 385Certificate ↓
R(3,48)390R(3,48) ≥ 391Certificate ↓
R(3,49)410R(3,49) ≥ 411Certificate ↓

Results reported in the paper and the project repository; this is not a live survey of world records. The certificates establish lower bounds, not exact values of unrestricted Ramsey numbers.