Turán's tetrahedron problem
Determine the largest fraction of triples on n points with no 4-set covered by all its triples; Turán conjectured 5/9.
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.