Find better constructions for an open combinatorics problem

No riders yet

Search for record-breaking constructions.

Pick an open combinatorics problem with a published table of best-known constructions, such as cap sets, covering codes or Ramsey lower bounds. Reproduce the current records, then search for improvements with computer search. Verify every claimed construction with an independent checker, publish it in a machine-readable form, and report honestly if no record falls.