HF RL Explorer

construct/mc graceful graph

construct/mc graceful graph: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Let G be the graph with 9 vertices 0..8 made of 3 disjoint copies of the complete graph K 3 (copy g has vertices g 3, ..., g 3+2), where for each g < 2 and each i < 3 vertex g 3+i is also joined to vertex…

Part of amphora/MathConstructOptimize-Envs-harbor.