HF RL Explorer

construct/mc ramsey

construct/mc ramsey: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Colour each of the 15 edges of the complete graph K 6 (vertices 0..5) with colour 0 or 1 so that there is no set of 3 vertices whose connecting edges all have colour 0, and no set of 4 vertices whose connecting…

The task

Colour each of the 15 edges of the complete graph K_6 (vertices 0..5) with colour 0 or 1 so that there is no set of 3 vertices whose connecting edges all have colour 0, and no set of 4 vertices whose connecting edges all have colour 1.

Part of amphora/MathConstructOptimize-Envs-harbor.