{"id":"palomar/PALOMAR-2026-11-14-000020","url":"https://github.com/Arth-Singh/ramsey-r55-lower-bound/tree/9128e900ed3de9429e1dab817d93b308a054e104","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-14-000020-v1.json","repo":"https://github.com/Arth-Singh/ramsey-r55-lower-bound","tags":["math.CO","msc:05D10","msc:05C55","msc:68V20"],"score":0,"title":"The lower bound R(5,5) ≥ 43: a kernel-checked Ramsey graph on 42 vertices","trust":"high","domain":"math.CO","source":"palomar","authors":["Arth Singh"],"reviews":0,"subject":"math.CO","summary":"A Lean 4 / Mathlib proof of Exoo's lower bound R(5,5) ≥ 43 for the diagonal graph Ramsey number: there is a simple graph on 42 vertices with no clique of size 5 and no independent set of size 5. The proof defines a clique scan on natural-number bit masks, proves that a scan with the result `false` excludes every clique of the given size, and lets the Lean kernel evaluate the scan on one explicit graph and on its complement (`decide +kernel`, no `native_decide`). The statement is the one that the Formal Conjectures repository records as `RamseyNumbers.ramsey_number_five_five_lower_bound`. The…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-14","reactions":{},"formalized":true,"formalizes":[{"title":"A lower bound for R(5,5)","identifier":"doi:10.1002/jgt.3190130113","relationship":"formalizes"}]}