The Erdős–Hajnal conjecture
Show that graphs avoiding a fixed induced subgraph H always contain a clique or independent set of size n^{c(H)}.
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.