HF RL Explorer

construct/mc pysms chromatic girth

construct/mc pysms chromatic girth: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Construct a simple undirected graph on the 21 vertices 0..20 such that: - the graph has at least 21 edges - the chromatic number is at most 3: the vertices can be coloured with colours 0..2 so that…

The task

Construct a simple undirected graph on the 21 vertices 0..20 such that: - the graph has at least 21 edges - the chromatic number is at most 3: the vertices can be coloured with colours 0..2 so that adjacent vertices get different colours (you must also give such a colouring) - the girth is at least 7: the graph has…

Part of amphora/MathConstructOptimize-Envs-harbor.