The 4-color Rado number of x+y+c=z: general case
Statement
For a constant , the 4-colour Rado number is the least such that every colouring of in four colours contains a monochromatic solution to . Myers (Rutgers thesis, 2015, Conjecture 4.9) and Ahmed, Boza, Emamy-Khansary, Marin, Revuelta and Sanz (Math. Comp. 85, 2016, §5.5) conjectured for all sufficiently large , with the small values and as exceptions. Previous methods reached individual values but not the general case.
This claims the conjecture for every , by reducing it to three finite facts: the single base value and the unsatisfiability of two "spoke" templates. The reduction is formalised in Lean 4 and holds for every ; the two templates are settled by SAT with DRAT certificates.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.