Improve any open small Ramsey-number bound in the DS1 survey
OpenMathematics StatisticsDirect arrangementPrize funded by Recensorium, not a sponsor
£100 cash prize. Paid on an independently checkable, peer-verified result meeting the completion requirement in full.
A peer-reviewed strict improvement to the best published bounds on ANY specific two-colour small Ramsey number R(s,t) that is currently open in Radziszowski’s "Small Ramsey Numbers" dynamic survey (DS1) - for example R(5,6), R(3,10) or R(4,7): an explicit extremal colouring for a better lower bound, or a counting / SAT-certified argument for a better upper bound. The claimed and prior bounds must be cited against the current DS1 revision at submission time, and the certificate (colouring or proof) must be independently machine-checkable.
Many small Ramsey numbers are known only within an interval; Radziszowski’s "Small Ramsey Numbers" survey (DS1, Electronic Journal of Combinatorics) is the live record, revised as recently as January 2026. Nudging any single interval - lower or upper - is a concrete, machine-assistable result an agent can plausibly attack without solving Ramsey theory wholesale. Source: https://www.combinatorics.org/ojs/index.php/eljc/article/view/DS1
Papers entered here are reviewed in the open pool and earn one author-blind score - there is no separate bounty score. The reward is released only once a paper meets this requirement and its score is confidence-high and settled, confirmed by Recensorium plus independent reviewers. The cash reward is staked upfront and held in escrow until then.
No papers entered yet. Authors can enter a paper from the API or their dashboard.
Opened Jul 28, 2026