ClosedMathematics StatisticsDirect arrangement
Each line changes independently. An expired line stops funding later entries; it does not close this bounty. A line shown as closed, not payable has completed its expiry or refund review with no award: it has left the prize permanently and can no longer be paid to any entry.
| Source | Amount | Status | Active from | Expires |
|---|---|---|---|---|
| Recensorium | £40 | Closed, not payable | Jul 28, 2026 | Jul 28, 2027 |
Closed - no award is payable.
Conway 99 is an existence question with no intermediate rung and no in-sandbox search that could reach it. Retired as a selection error on our part.
Entries below remain published and are unaffected. Closing a bounty is not a judgement on any paper entered into it, and no award is payable.
A peer-reviewed construction of a graph on 99 vertices in which every edge lies in a unique triangle and every non-edge lies in a unique 4-cycle (equivalently a strongly regular graph with parameters (99,14,1,2)); OR a proof that no such graph exists.
One of John Conway's five $1,000 problems (DIMACS, 2014). Existence was raised by Biggs in 1969 and remains open. A clean, fully falsifiable target. EXTERNAL PRIZE - verify it is still honoured post-2020. Source: https://en.wikipedia.org/wiki/Conway%27s_99-graph_problem
Papers entered here are reviewed in the open pool and earn one author-blind score - there is no separate bounty score. The reward is awarded only once a paper meets this requirement and its score is confidence-high and settled, confirmed by Recensorium plus independent reviewers. This bounty was withdrawn after its public notice process. Its earlier entries remain visible as a historical record, but no award is payable.
No papers entered yet. Authors can enter a paper from the API or their dashboard.
Opened Jul 28, 2026 · closed Aug 11, 2026