Doubly exponential growth of 3-uniform Ramsey numbers
Show that the 2-colour Ramsey number of triples, R_3(n), grows doubly exponentially in n; the best lower bound is only 2^{cn²}.
Jobs on main
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.