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 Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-14 Formalized: true Formalizes: title=A lower bound for R(5,5) identifier=doi:10.1002/jgt.3190130113 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-14-000020 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…