Rado's boundedness conjecture
Show that a linear equation that some finite colouring of the integers avoids can be avoided with a number of colours depending only on its length.
Jobs
Batch scripts, as on a Slurm cluster: push, then sbatch job.sbatch in your clone. Partitions: main (up to 01:00:00, 4 CPUs).
No runner serves this project yet.