task_id stringlengths 23 52 | subset stringclasses 1
value | family stringclasses 80
values | problem_key stringclasses 75
values | domain stringclasses 8
values | tier stringclasses 2
values | level stringclasses 6
values | source stringclasses 80
values | license stringclasses 3
values | tags listlengths 0 4 | prompt stringlengths 308 37k | instance stringlengths 56 37.8k | direction null | baseline null | best_known null | reference_answer stringlengths 8 198k | reference_reward float64 1 1 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
construct-rlve-max-achromatic-coloring-l6-s6 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 6 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [1, 2], [1, 3], [1, 4], [1, 9], [1, 11], [2, 3], [2, 6], [2, 7], [2, 8], [2, 9], [2, 11], [2, 12], [2, 13], [3, 4], [3, 5], [3, 6], [3, 7], [3, 12], [3, 13], [4, 9], [4, 10],... | {"n": 14, "k": 9, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [1, 2], [1, 3], [1, 4], [1, 9], [1, 11], [2, 3], [2, 6], [2, 7], [2, 8], [2, 9], [2, 11], [2, 12], [2, 13], [3, 4], [3, 5], [3, 6], [3, 7], [3, 12], [3, 13], [4, 9], [4, 10], [5, 6], [5, 7], [5, 9], [5, 10], [5, 12], [6... | null | null | null | {"colors": [0, 1, 2, 3, 4, 1, 5, 6, 4, 7, 8, 3, 8, 5]} | 1 |
construct-rlve-max-achromatic-coloring-l6-s7 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 6 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 2], [0, 3], [0, 5], [0, 6], [0, 8], [0, 9], [0, 11], [1, 3], [1, 11], [1, 12], [2, 5], [2, 6], [2, 8], [2, 11], [2, 12], [2, 13], [3, 4], [3, 5], [3, 6], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, ... | {"n": 14, "k": 8, "edges": [[0, 2], [0, 3], [0, 5], [0, 6], [0, 8], [0, 9], [0, 11], [1, 3], [1, 11], [1, 12], [2, 5], [2, 6], [2, 8], [2, 11], [2, 12], [2, 13], [3, 4], [3, 5], [3, 6], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [4, 6], [4, 7], [4, 8], [4, 9], [4, 10], [4, 11], [4, 12], [5, 6], [5, 7], [5, 8], [5, 9],... | null | null | null | {"colors": [0, 0, 1, 2, 0, 3, 4, 2, 5, 1, 6, 5, 7, 6]} | 1 |
construct-rlve-max-achromatic-coloring-l6-s8 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 6 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 2], [0, 6], [0, 7], [0, 8], [1, 2], [1, 3], [1, 4], [1, 6], [1, 7], [1, 8], [1, 9], [2, 7], [2, 11], [2, 13], [3, 5], [3, 6], [3, 7], [3, 8], [3, 10], [3, 12], [4, 5], [4, 9], [4, 10], [5, 7], [5, 10], [5, 12], [5, 13], [6, 7], [6, 8], [6, 9],... | {"n": 14, "k": 8, "edges": [[0, 2], [0, 6], [0, 7], [0, 8], [1, 2], [1, 3], [1, 4], [1, 6], [1, 7], [1, 8], [1, 9], [2, 7], [2, 11], [2, 13], [3, 5], [3, 6], [3, 7], [3, 8], [3, 10], [3, 12], [4, 5], [4, 9], [4, 10], [5, 7], [5, 10], [5, 12], [5, 13], [6, 7], [6, 8], [6, 9], [6, 12], [7, 9], [7, 10], [7, 12], [9, 12], ... | null | null | null | {"colors": [0, 1, 2, 2, 3, 4, 5, 6, 4, 7, 7, 1, 3, 0]} | 1 |
construct-rlve-max-achromatic-coloring-l6-s9 | construct | rlve_max_achromatic_coloring | achromatic_number | graph_theory | competition | 6 | RLVE-Gym/maximum_achromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 2], [0, 3], [0, 8], [0, 10], [1, 2], [1, 3], [1, 8], [1, 10], [1, 11], [1, 13], [2, 3], [2, 5], [2, 8], [2, 12], [2, 13], [3, 7], [3, 9], [3, 11], [3, 13], [4, 5], [4, 6], [4, 8], [4, 10], [4, 11], [4, 13], [5, 6], [5, 7], [5, 8], [5, ... | {"n": 14, "k": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 8], [0, 10], [1, 2], [1, 3], [1, 8], [1, 10], [1, 11], [1, 13], [2, 3], [2, 5], [2, 8], [2, 12], [2, 13], [3, 7], [3, 9], [3, 11], [3, 13], [4, 5], [4, 6], [4, 8], [4, 10], [4, 11], [4, 13], [5, 6], [5, 7], [5, 8], [5, 11], [5, 12], [6, 8], [6, 12], [6, 13], [7, 1... | null | null | null | {"colors": [0, 1, 2, 3, 2, 4, 0, 5, 6, 6, 5, 7, 7, 4]} | 1 |
construct-rlve-maximum-clique-l1-s0 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 1 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 2], [0, 4], [0, 5], [0, 6], [0, 7], [1, 2], [1, 4], [1, 5], [1, 6], [2, 4], [2, 5], [2, 6], [2, 7], [3, 4], [3, 5], [3, 6], [3, 7], [4, 6], [4, 7], [5, 6], [6, 7]]
The largest clique in this graph has exactly 5 vertices. Find a clique of size 5... | {"n": 8, "k": 5, "edges": [[0, 2], [0, 4], [0, 5], [0, 6], [0, 7], [1, 2], [1, 4], [1, 5], [1, 6], [2, 4], [2, 5], [2, 6], [2, 7], [3, 4], [3, 5], [3, 6], [3, 7], [4, 6], [4, 7], [5, 6], [6, 7]], "family": "rlve_maximum_clique", "subset": "construct"} | null | null | null | {"clique": [0, 2, 4, 6, 7]} | 1 |
construct-rlve-maximum-clique-l1-s1 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 1 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [1, 2], [1, 3], [1, 4], [1, 6], [1, 7], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [3, 6], [3, 7], [4, 5], [4, 7], [5, 6]]
The largest clique in this graph has exactly 5 vertices. Find a clique of size 5... | {"n": 8, "k": 5, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [1, 2], [1, 3], [1, 4], [1, 6], [1, 7], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [3, 6], [3, 7], [4, 5], [4, 7], [5, 6]], "family": "rlve_maximum_clique", "subset": "construct"} | null | null | null | {"clique": [0, 1, 2, 3, 6]} | 1 |
construct-rlve-maximum-clique-l1-s2 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 1 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 4], [0, 5], [0, 6], [1, 3], [1, 4], [1, 5], [1, 7], [2, 5], [3, 5], [3, 6], [3, 7], [4, 5], [4, 6], [5, 6], [6, 7]]
The largest clique in this graph has exactly 4 vertices. Find a clique of size 4: 4 distinct vertices every two of which are adj... | {"n": 8, "k": 4, "edges": [[0, 4], [0, 5], [0, 6], [1, 3], [1, 4], [1, 5], [1, 7], [2, 5], [3, 5], [3, 6], [3, 7], [4, 5], [4, 6], [5, 6], [6, 7]], "family": "rlve_maximum_clique", "subset": "construct"} | null | null | null | {"clique": [0, 4, 5, 6]} | 1 |
construct-rlve-maximum-clique-l1-s3 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 1 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 2], [0, 5], [0, 7], [1, 2], [1, 5], [1, 7], [2, 3], [2, 5], [2, 7], [3, 6], [3, 7], [4, 5], [4, 7], [5, 7], [6, 7]]
The largest clique in this graph has exactly 4 vertices. Find a clique of size 4: 4 distinct vertices every two of which are adj... | {"n": 8, "k": 4, "edges": [[0, 2], [0, 5], [0, 7], [1, 2], [1, 5], [1, 7], [2, 3], [2, 5], [2, 7], [3, 6], [3, 7], [4, 5], [4, 7], [5, 7], [6, 7]], "family": "rlve_maximum_clique", "subset": "construct"} | null | null | null | {"clique": [0, 2, 5, 7]} | 1 |
construct-rlve-maximum-clique-l1-s4 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 1 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 1], [0, 4], [0, 7], [1, 2], [1, 3], [1, 6], [2, 3], [2, 4], [3, 4], [3, 5], [3, 6], [4, 5], [4, 6], [5, 6], [6, 7]]
The largest clique in this graph has exactly 4 vertices. Find a clique of size 4: 4 distinct vertices every two of which are adj... | {"n": 8, "k": 4, "edges": [[0, 1], [0, 4], [0, 7], [1, 2], [1, 3], [1, 6], [2, 3], [2, 4], [3, 4], [3, 5], [3, 6], [4, 5], [4, 6], [5, 6], [6, 7]], "family": "rlve_maximum_clique", "subset": "construct"} | null | null | null | {"clique": [3, 4, 5, 6]} | 1 |
construct-rlve-maximum-clique-l1-s5 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 1 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 3], [0, 4], [2, 4], [2, 5], [2, 6], [2, 7], [3, 4], [3, 6], [6, 7]]
The largest clique in this graph has exactly 3 vertices. Find a clique of size 3: 3 distinct vertices every two of which are adjacent.
Answer format: {"clique": [v_1, ..., v_3... | {"n": 8, "k": 3, "edges": [[0, 3], [0, 4], [2, 4], [2, 5], [2, 6], [2, 7], [3, 4], [3, 6], [6, 7]], "family": "rlve_maximum_clique", "subset": "construct"} | null | null | null | {"clique": [0, 3, 4]} | 1 |
construct-rlve-maximum-clique-l1-s6 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 1 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 2], [1, 2], [1, 5], [1, 6], [1, 7], [2, 4], [2, 5], [3, 5], [3, 7]]
The largest clique in this graph has exactly 3 vertices. Find a clique of size 3: 3 distinct vertices every two of which are adjacent.
Answer format: {"clique": [v_1, ..., v_3... | {"n": 8, "k": 3, "edges": [[0, 2], [1, 2], [1, 5], [1, 6], [1, 7], [2, 4], [2, 5], [3, 5], [3, 7]], "family": "rlve_maximum_clique", "subset": "construct"} | null | null | null | {"clique": [1, 2, 5]} | 1 |
construct-rlve-maximum-clique-l1-s7 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 1 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 1], [0, 2], [0, 5], [0, 6], [1, 2], [1, 3], [1, 4], [1, 7], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [3, 4], [3, 6], [3, 7], [4, 5], [4, 6], [4, 7], [5, 6], [6, 7]]
The largest clique in this graph has exactly 5 vertices. Find a clique of size 5... | {"n": 8, "k": 5, "edges": [[0, 1], [0, 2], [0, 5], [0, 6], [1, 2], [1, 3], [1, 4], [1, 7], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [3, 4], [3, 6], [3, 7], [4, 5], [4, 6], [4, 7], [5, 6], [6, 7]], "family": "rlve_maximum_clique", "subset": "construct"} | null | null | null | {"clique": [1, 2, 3, 4, 7]} | 1 |
construct-rlve-maximum-clique-l1-s8 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 1 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 1], [0, 3], [0, 5], [0, 6], [0, 7], [1, 2], [1, 5], [1, 6], [1, 7], [2, 3], [2, 4], [2, 6], [2, 7], [3, 4], [3, 5], [3, 6], [4, 5], [4, 6], [5, 6], [5, 7], [6, 7]]
The largest clique in this graph has exactly 5 vertices. Find a clique of size 5... | {"n": 8, "k": 5, "edges": [[0, 1], [0, 3], [0, 5], [0, 6], [0, 7], [1, 2], [1, 5], [1, 6], [1, 7], [2, 3], [2, 4], [2, 6], [2, 7], [3, 4], [3, 5], [3, 6], [4, 5], [4, 6], [5, 6], [5, 7], [6, 7]], "family": "rlve_maximum_clique", "subset": "construct"} | null | null | null | {"clique": [0, 1, 5, 6, 7]} | 1 |
construct-rlve-maximum-clique-l1-s9 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 1 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 8 vertices labelled 0..7 and edge list
[[0, 1], [0, 5], [0, 6], [0, 7], [1, 3], [1, 7], [2, 3], [2, 4], [2, 7], [3, 4], [3, 5], [3, 7], [4, 6], [4, 7], [6, 7]]
The largest clique in this graph has exactly 4 vertices. Find a clique of size 4: 4 distinct vertices every two of which are adj... | {"n": 8, "k": 4, "edges": [[0, 1], [0, 5], [0, 6], [0, 7], [1, 3], [1, 7], [2, 3], [2, 4], [2, 7], [3, 4], [3, 5], [3, 7], [4, 6], [4, 7], [6, 7]], "family": "rlve_maximum_clique", "subset": "construct"} | null | null | null | {"clique": [2, 3, 4, 7]} | 1 |
construct-rlve-maximum-clique-l2-s0 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 2 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 3], [0, 4], [0, 7], [0, 10], [0, 12], [1, 4], [1, 6], [1, 7], [2, 4], [2, 5], [2, 6], [2, 12], [2, 13], [3, 8], [3, 10], [3, 11], [3, 12], [4, 5], [4, 7], [4, 9], [4, 12], [5, 6], [5, 8], [5, 10], [5, 13], [6, 9], [6, 11], [7, 11], [8,... | {"n": 14, "k": 4, "edges": [[0, 1], [0, 3], [0, 4], [0, 7], [0, 10], [0, 12], [1, 4], [1, 6], [1, 7], [2, 4], [2, 5], [2, 6], [2, 12], [2, 13], [3, 8], [3, 10], [3, 11], [3, 12], [4, 5], [4, 7], [4, 9], [4, 12], [5, 6], [5, 8], [5, 10], [5, 13], [6, 9], [6, 11], [7, 11], [8, 10], [9, 11]], "family": "rlve_maximum_cliqu... | null | null | null | {"clique": [0, 1, 4, 7]} | 1 |
construct-rlve-maximum-clique-l2-s1 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 2 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 2], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 12], [1, 3], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 12], [1, 13], [2, 3], [2, 5], [2, 6], [2, 8], [2, 9], [2, 11], [2, 12], [2, 13], [3, 4], [3, 7], [3, 8], [3, 9],... | {"n": 14, "k": 6, "edges": [[0, 1], [0, 2], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 12], [1, 3], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 12], [1, 13], [2, 3], [2, 5], [2, 6], [2, 8], [2, 9], [2, 11], [2, 12], [2, 13], [3, 4], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [4, 5], [4, 6], [... | null | null | null | {"clique": [0, 1, 5, 6, 7, 9]} | 1 |
construct-rlve-maximum-clique-l2-s2 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 2 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [1, 2], [1, 4], [1, 5], [1, 8], [1, 10], [1, 11], [1, 13], [2, 5], [2, 7], [2, 8], [2, 9], [2, 11], [2, 12], [2, 13], [3, 4], [3, 5], [3, 6], [3, 7... | {"n": 14, "k": 6, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [1, 2], [1, 4], [1, 5], [1, 8], [1, 10], [1, 11], [1, 13], [2, 5], [2, 7], [2, 8], [2, 9], [2, 11], [2, 12], [2, 13], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12],... | null | null | null | {"clique": [0, 2, 7, 8, 9, 13]} | 1 |
construct-rlve-maximum-clique-l2-s3 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 2 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 5], [0, 7], [0, 9], [0, 13], [1, 7], [1, 11], [2, 7], [2, 8], [2, 9], [2, 10], [2, 12], [3, 8], [3, 9], [3, 13], [4, 5], [4, 11], [5, 11], [6, 9], [6, 10], [6, 11], [6, 13], [7, 8], [7, 10], [7, 11], [8, 10], [8, 12], [9, 10], [9, 12],... | {"n": 14, "k": 4, "edges": [[0, 1], [0, 5], [0, 7], [0, 9], [0, 13], [1, 7], [1, 11], [2, 7], [2, 8], [2, 9], [2, 10], [2, 12], [3, 8], [3, 9], [3, 13], [4, 5], [4, 11], [5, 11], [6, 9], [6, 10], [6, 11], [6, 13], [7, 8], [7, 10], [7, 11], [8, 10], [8, 12], [9, 10], [9, 12], [10, 13], [11, 13]], "family": "rlve_maximum... | null | null | null | {"clique": [2, 7, 8, 10]} | 1 |
construct-rlve-maximum-clique-l2-s4 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 2 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 7], [0, 9], [0, 10], [0, 11], [0, 13], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 13]... | {"n": 14, "k": 6, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 7], [0, 9], [0, 10], [0, 11], [0, 13], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 13], [3, 4], [3, 5], [3, 8], [3, 9], [3, 10], [3... | null | null | null | {"clique": [0, 1, 3, 4, 10, 11]} | 1 |
construct-rlve-maximum-clique-l2-s5 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 2 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 10], [0, 11], [0, 12], [0, 13], [1, 4], [1, 9], [1, 12], [2, 5], [2, 8], [2, 9], [2, 10], [2, 11], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 11], [3, 12], [3, 13], [4, 6], [4, 7], [4, 9... | {"n": 14, "k": 5, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 10], [0, 11], [0, 12], [0, 13], [1, 4], [1, 9], [1, 12], [2, 5], [2, 8], [2, 9], [2, 10], [2, 11], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 11], [3, 12], [3, 13], [4, 6], [4, 7], [4, 9], [4, 11], [4, 13], [5, 6], [5, 13], [6, 8],... | null | null | null | {"clique": [0, 3, 4, 6, 11]} | 1 |
construct-rlve-maximum-clique-l2-s6 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 2 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 8], [1, 9], [1, 10], [1, 12], [1, 13], [2, 3], [2, 4], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 13], [3, 4],... | {"n": 14, "k": 7, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 8], [1, 9], [1, 10], [1, 12], [1, 13], [2, 3], [2, 4], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 13], [3, 4], [3, 5], [3, 6], [3, 10], [3, 12], [3, 13], [... | null | null | null | {"clique": [0, 1, 2, 3, 4, 6, 10]} | 1 |
construct-rlve-maximum-clique-l2-s7 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 2 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 3], [0, 7], [0, 9], [0, 10], [0, 11], [0, 13], [1, 2], [1, 5], [1, 6], [1, 7], [1, 8], [1, 10], [1, 13], [2, 3], [2, 5], [2, 6], [2, 8], [2, 9], [2, 10], [3, 4], [3, 6], [3, 9], [3, 10], [3, 11], [4, 5], [4, 8], [4, 9], [4, 11], [4, 12... | {"n": 14, "k": 5, "edges": [[0, 1], [0, 3], [0, 7], [0, 9], [0, 10], [0, 11], [0, 13], [1, 2], [1, 5], [1, 6], [1, 7], [1, 8], [1, 10], [1, 13], [2, 3], [2, 5], [2, 6], [2, 8], [2, 9], [2, 10], [3, 4], [3, 6], [3, 9], [3, 10], [3, 11], [4, 5], [4, 8], [4, 9], [4, 11], [4, 12], [4, 13], [5, 7], [5, 8], [5, 9], [5, 11], ... | null | null | null | {"clique": [1, 2, 6, 8, 10]} | 1 |
construct-rlve-maximum-clique-l2-s8 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 2 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 3], [0, 4], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [1, 2], [1, 4], [1, 5], [1, 6], [1, 13], [2, 3], [2, 5], [2, 7], [2, 8], [2, 9], [2, 12], [3, 4], [3, 5], [3, 6], [3, 7], [3, 9], [3, 12], [3, 13], [4, 6], [4, 8], [4, 10]... | {"n": 14, "k": 6, "edges": [[0, 1], [0, 3], [0, 4], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [1, 2], [1, 4], [1, 5], [1, 6], [1, 13], [2, 3], [2, 5], [2, 7], [2, 8], [2, 9], [2, 12], [3, 4], [3, 5], [3, 6], [3, 7], [3, 9], [3, 12], [3, 13], [4, 6], [4, 8], [4, 10], [4, 11], [5, 6], [5, 7], [5, 9], [5, 11], [... | null | null | null | {"clique": [2, 3, 5, 7, 9, 12]} | 1 |
construct-rlve-maximum-clique-l2-s9 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 2 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 4], [0, 6], [0, 7], [0, 13], [1, 5], [1, 6], [1, 8], [2, 5], [2, 6], [2, 12], [3, 5], [3, 7], [3, 11], [3, 13], [4, 5], [4, 11], [4, 13], [5, 9], [5, 10], [5, 11], [5, 13], [6, 7], [6, 8], [6, 9], [6, 11], [7, 8], [7, 12], [8, 9], [8, ... | {"n": 14, "k": 3, "edges": [[0, 1], [0, 4], [0, 6], [0, 7], [0, 13], [1, 5], [1, 6], [1, 8], [2, 5], [2, 6], [2, 12], [3, 5], [3, 7], [3, 11], [3, 13], [4, 5], [4, 11], [4, 13], [5, 9], [5, 10], [5, 11], [5, 13], [6, 7], [6, 8], [6, 9], [6, 11], [7, 8], [7, 12], [8, 9], [8, 12], [10, 12]], "family": "rlve_maximum_cliqu... | null | null | null | {"clique": [0, 1, 6]} | 1 |
construct-rlve-maximum-clique-l3-s0 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 3 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 22 vertices labelled 0..21 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 13], [0, 14], [0, 16], [0, 17], [0, 20], [0, 21], [1, 2], [1, 3], [1, 4], [1, 6], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], ... | {"n": 22, "k": 11, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 13], [0, 14], [0, 16], [0, 17], [0, 20], [0, 21], [1, 2], [1, 3], [1, 4], [1, 6], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [2, 3], [2, 4], [... | null | null | null | {"clique": [0, 1, 2, 3, 4, 8, 9, 11, 13, 16, 17]} | 1 |
construct-rlve-maximum-clique-l3-s1 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 3 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 22 vertices labelled 0..21 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 9], [0, 10], [0, 11], [0, 12], [0, 14], [0, 16], [0, 17], [0, 19], [0, 20], [1, 3], [1, 4], [1, 5], [1, 8], [1, 9], [1, 10], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [2, 3], [2, 6], [2, 7], [... | {"n": 22, "k": 7, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 9], [0, 10], [0, 11], [0, 12], [0, 14], [0, 16], [0, 17], [0, 19], [0, 20], [1, 3], [1, 4], [1, 5], [1, 8], [1, 9], [1, 10], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [2, 3], [2, 6], [2, 7], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [... | null | null | null | {"clique": [0, 1, 3, 4, 5, 10, 17]} | 1 |
construct-rlve-maximum-clique-l3-s2 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 3 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 22 vertices labelled 0..21 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 7], [0, 8], [0, 9], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 18], [0, 19], [0, 20], [0, 21], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1... | {"n": 22, "k": 11, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 7], [0, 8], [0, 9], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 18], [0, 19], [0, 20], [0, 21], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 17], [1, 19], [1, 20], [... | null | null | null | {"clique": [0, 1, 2, 4, 5, 8, 11, 12, 14, 20, 21]} | 1 |
construct-rlve-maximum-clique-l3-s3 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 3 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 22 vertices labelled 0..21 and edge list
[[0, 1], [0, 2], [0, 3], [0, 9], [0, 10], [0, 14], [0, 15], [0, 18], [0, 19], [0, 20], [0, 21], [1, 3], [1, 6], [1, 7], [1, 11], [1, 12], [1, 14], [1, 21], [2, 5], [2, 6], [2, 7], [2, 8], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 17], [2, 18... | {"n": 22, "k": 5, "edges": [[0, 1], [0, 2], [0, 3], [0, 9], [0, 10], [0, 14], [0, 15], [0, 18], [0, 19], [0, 20], [0, 21], [1, 3], [1, 6], [1, 7], [1, 11], [1, 12], [1, 14], [1, 21], [2, 5], [2, 6], [2, 7], [2, 8], [2, 11], [2, 12], [2, 13], [2, 14], [2, 15], [2, 17], [2, 18], [2, 19], [2, 20], [3, 6], [3, 8], [3, 9], ... | null | null | null | {"clique": [0, 2, 14, 15, 20]} | 1 |
construct-rlve-maximum-clique-l3-s4 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 3 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 22 vertices labelled 0..21 and edge list
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [1, 2], [1, 3], [1, 6], [1, 8], [1, 9], [1, 10], [1, 11], [1, 13], [1, 14],... | {"n": 22, "k": 12, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [1, 2], [1, 3], [1, 6], [1, 8], [1, 9], [1, 10], [1, 11], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19]... | null | null | null | {"clique": [0, 4, 5, 6, 7, 8, 11, 12, 15, 17, 19, 20]} | 1 |
construct-rlve-maximum-clique-l3-s5 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 3 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 22 vertices labelled 0..21 and edge list
[[0, 4], [0, 6], [0, 8], [0, 9], [0, 11], [0, 15], [0, 16], [0, 20], [1, 4], [1, 11], [1, 12], [1, 14], [1, 15], [1, 16], [1, 19], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 10], [2, 17], [3, 4], [3, 5], [3, 6], [3, 8], [3, 11], [3, 12], [3, 13], ... | {"n": 22, "k": 5, "edges": [[0, 4], [0, 6], [0, 8], [0, 9], [0, 11], [0, 15], [0, 16], [0, 20], [1, 4], [1, 11], [1, 12], [1, 14], [1, 15], [1, 16], [1, 19], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 10], [2, 17], [3, 4], [3, 5], [3, 6], [3, 8], [3, 11], [3, 12], [3, 13], [3, 14], [3, 19], [3, 21], [4, 6], [4, 8], [4... | null | null | null | {"clique": [0, 4, 6, 8, 16]} | 1 |
construct-rlve-maximum-clique-l3-s6 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 3 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 22 vertices labelled 0..21 and edge list
[[0, 3], [0, 5], [0, 8], [0, 9], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 16], [1, 18], [1, 19], [1, 20], [1, 21], [2, 3], [2, 4]... | {"n": 22, "k": 8, "edges": [[0, 3], [0, 5], [0, 8], [0, 9], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 16], [1, 18], [1, 19], [1, 20], [1, 21], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 10], [2... | null | null | null | {"clique": [1, 2, 4, 6, 7, 12, 14, 18]} | 1 |
construct-rlve-maximum-clique-l3-s7 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 3 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 22 vertices labelled 0..21 and edge list
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 10], [1, 11], [1, 12], [1, 15], ... | {"n": 22, "k": 11, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 10], [1, 11], [1, 12], [1, 15], [1, 16], [1, 17], [1, 19], [1, 21], [2, 3], ... | null | null | null | {"clique": [0, 2, 3, 6, 7, 8, 13, 15, 18, 19, 20]} | 1 |
construct-rlve-maximum-clique-l3-s8 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 3 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 22 vertices labelled 0..21 and edge list
[[0, 1], [0, 2], [0, 5], [0, 9], [0, 11], [0, 12], [0, 13], [0, 17], [0, 18], [0, 20], [1, 5], [1, 7], [1, 9], [1, 10], [1, 15], [1, 19], [2, 3], [2, 4], [2, 5], [2, 9], [2, 12], [2, 13], [2, 17], [2, 18], [3, 7], [3, 8], [3, 9], [3, 10], [3, 12], ... | {"n": 22, "k": 5, "edges": [[0, 1], [0, 2], [0, 5], [0, 9], [0, 11], [0, 12], [0, 13], [0, 17], [0, 18], [0, 20], [1, 5], [1, 7], [1, 9], [1, 10], [1, 15], [1, 19], [2, 3], [2, 4], [2, 5], [2, 9], [2, 12], [2, 13], [2, 17], [2, 18], [3, 7], [3, 8], [3, 9], [3, 10], [3, 12], [3, 13], [3, 18], [3, 19], [4, 6], [4, 7], [4... | null | null | null | {"clique": [0, 2, 5, 12, 13]} | 1 |
construct-rlve-maximum-clique-l3-s9 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 3 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 22 vertices labelled 0..21 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1... | {"n": 22, "k": 10, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [... | null | null | null | {"clique": [0, 1, 2, 3, 4, 7, 9, 10, 11, 17]} | 1 |
construct-rlve-maximum-clique-l4-s0 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 4 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 32 vertices labelled 0..31 and edge list
[[0, 1], [0, 2], [0, 4], [0, 6], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 27], [0, 29], [0, 30], [1, 2], [1, 4], [1, 6], [1, 7], [1, 10], [1, 12], [1, 13], [1,... | {"n": 32, "k": 8, "edges": [[0, 1], [0, 2], [0, 4], [0, 6], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 27], [0, 29], [0, 30], [1, 2], [1, 4], [1, 6], [1, 7], [1, 10], [1, 12], [1, 13], [1, 14], [1, 18], [1, 19], [1, 20], [1, 21], [1,... | null | null | null | {"clique": [0, 1, 6, 13, 14, 20, 22, 24]} | 1 |
construct-rlve-maximum-clique-l4-s1 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 4 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 32 vertices labelled 0..31 and edge list
[[0, 4], [0, 5], [0, 6], [0, 8], [0, 13], [0, 14], [0, 16], [0, 18], [0, 19], [0, 20], [0, 22], [0, 23], [0, 25], [0, 26], [0, 28], [0, 29], [0, 31], [1, 2], [1, 3], [1, 6], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 19], [1, 23], [1, ... | {"n": 32, "k": 6, "edges": [[0, 4], [0, 5], [0, 6], [0, 8], [0, 13], [0, 14], [0, 16], [0, 18], [0, 19], [0, 20], [0, 22], [0, 23], [0, 25], [0, 26], [0, 28], [0, 29], [0, 31], [1, 2], [1, 3], [1, 6], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 19], [1, 23], [1, 24], [1, 27], [1, 28], [1, 30], [1, 31], [2, ... | null | null | null | {"clique": [0, 6, 8, 13, 18, 31]} | 1 |
construct-rlve-maximum-clique-l4-s2 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 4 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 32 vertices labelled 0..31 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 10], [0, 12], [0, 13], [0, 14], [0, 16], [0, 18], [0, 19], [0, 21], [0, 22], [0, 24], [0, 25], [0, 26], [0, 28], [0, 29], [0, 30], [0, 31], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 9],... | {"n": 32, "k": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 10], [0, 12], [0, 13], [0, 14], [0, 16], [0, 18], [0, 19], [0, 21], [0, 22], [0, 24], [0, 25], [0, 26], [0, 28], [0, 29], [0, 30], [0, 31], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 16], [1, 17], [1, 19], [1, 20],... | null | null | null | {"clique": [0, 2, 3, 5, 8, 14, 18, 21]} | 1 |
construct-rlve-maximum-clique-l4-s3 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 4 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 32 vertices labelled 0..31 and edge list
[[0, 2], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 11], [0, 13], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 30], [1, 2], [1, 3], [1, 5], [1, 6], [1, 7], [1, 8],... | {"n": 32, "k": 12, "edges": [[0, 2], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 11], [0, 13], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 30], [1, 2], [1, 3], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13],... | null | null | null | {"clique": [3, 4, 6, 11, 12, 17, 18, 19, 21, 22, 29, 30]} | 1 |
construct-rlve-maximum-clique-l4-s4 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 4 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 32 vertices labelled 0..31 and edge list
[[0, 2], [0, 3], [0, 4], [0, 8], [0, 9], [0, 10], [0, 11], [0, 13], [0, 14], [0, 15], [0, 21], [0, 22], [0, 23], [0, 26], [0, 27], [0, 29], [0, 30], [0, 31], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 9], [1, 11], [1, 12], [1, 13], [1, 16], [1, 17... | {"n": 32, "k": 8, "edges": [[0, 2], [0, 3], [0, 4], [0, 8], [0, 9], [0, 10], [0, 11], [0, 13], [0, 14], [0, 15], [0, 21], [0, 22], [0, 23], [0, 26], [0, 27], [0, 29], [0, 30], [0, 31], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 9], [1, 11], [1, 12], [1, 13], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22... | null | null | null | {"clique": [0, 3, 9, 15, 21, 22, 23, 26]} | 1 |
construct-rlve-maximum-clique-l4-s5 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 4 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 32 vertices labelled 0..31 and edge list
[[0, 1], [0, 2], [0, 3], [0, 6], [0, 8], [0, 9], [0, 11], [0, 12], [0, 14], [0, 15], [0, 16], [0, 20], [0, 22], [0, 23], [0, 24], [0, 26], [0, 27], [0, 29], [0, 31], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 15], [1, 18], [1, 21],... | {"n": 32, "k": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 6], [0, 8], [0, 9], [0, 11], [0, 12], [0, 14], [0, 15], [0, 16], [0, 20], [0, 22], [0, 23], [0, 24], [0, 26], [0, 27], [0, 29], [0, 31], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 15], [1, 18], [1, 21], [1, 22], [1, 24], [1, 25], [1, 26], [1, 27],... | null | null | null | {"clique": [0, 6, 12, 14, 20, 23, 24, 29]} | 1 |
construct-rlve-maximum-clique-l4-s6 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 4 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 32 vertices labelled 0..31 and edge list
[[0, 3], [0, 4], [0, 6], [0, 7], [0, 8], [0, 11], [0, 13], [0, 14], [0, 18], [0, 24], [0, 25], [0, 27], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 8], [1, 9], [1, 14], [1, 15], [1, 17], [1, 19], [1, 21], [1, 23], [1, 26], [1, 27], [1, 30], [2, 3],... | {"n": 32, "k": 7, "edges": [[0, 3], [0, 4], [0, 6], [0, 7], [0, 8], [0, 11], [0, 13], [0, 14], [0, 18], [0, 24], [0, 25], [0, 27], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 8], [1, 9], [1, 14], [1, 15], [1, 17], [1, 19], [1, 21], [1, 23], [1, 26], [1, 27], [1, 30], [2, 3], [2, 4], [2, 5], [2, 8], [2, 11], [2, 13], [2... | null | null | null | {"clique": [1, 2, 4, 5, 8, 14, 30]} | 1 |
construct-rlve-maximum-clique-l4-s7 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 4 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 32 vertices labelled 0..31 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 17], [0, 18], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 30], [0, 31], [1, ... | {"n": 32, "k": 12, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 17], [0, 18], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 30], [0, 31], [1, 4], [1, 5], [1, 8], [1, 11], [1, 13], [1, 14... | null | null | null | {"clique": [0, 4, 5, 6, 8, 9, 12, 13, 18, 22, 23, 24]} | 1 |
construct-rlve-maximum-clique-l4-s8 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 4 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 32 vertices labelled 0..31 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 19], [0, 20], [0, 21], [0, 22], [0, 24], [0, 25], [0, 26], [0, 27], [0, 29], [0, 31], [1, 2], [1, 3], [1, 4... | {"n": 32, "k": 11, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 19], [0, 20], [0, 21], [0, 22], [0, 24], [0, 25], [0, 26], [0, 27], [0, 29], [0, 31], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 11], [1, 13],... | null | null | null | {"clique": [0, 1, 3, 5, 6, 15, 19, 21, 26, 29, 31]} | 1 |
construct-rlve-maximum-clique-l4-s9 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 4 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 32 vertices labelled 0..31 and edge list
[[0, 3], [0, 4], [0, 5], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 20], [0, 22], [0, 23], [0, 24], [0, 25], [0, 27], [0, 30], [0, 31], [1, 2], [1, 3], [1, 4], [1, 7], [1, 10], [1, 14], [1, 15], [1, 16], [1, 17], [1... | {"n": 32, "k": 6, "edges": [[0, 3], [0, 4], [0, 5], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 20], [0, 22], [0, 23], [0, 24], [0, 25], [0, 27], [0, 30], [0, 31], [1, 2], [1, 3], [1, 4], [1, 7], [1, 10], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 22], [1, 27], [1... | null | null | null | {"clique": [0, 3, 4, 11, 17, 24]} | 1 |
construct-rlve-maximum-clique-l5-s0 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 5 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 44 vertices labelled 0..43 and edge list
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 17], [0, 18], [0, 19], [0, 22], [0, 23], [0, 24], [0, 26], [0, 27], [0, 28], [0, 30], [0, 31], [0, 32], [0, 33], [0, 34], [0,... | {"n": 44, "k": 13, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 17], [0, 18], [0, 19], [0, 22], [0, 23], [0, 24], [0, 26], [0, 27], [0, 28], [0, 30], [0, 31], [0, 32], [0, 33], [0, 34], [0, 37], [0, 40], [1, 2], [1, 3], [1, 4], [1, 5... | null | null | null | {"clique": [1, 8, 12, 15, 16, 20, 21, 22, 24, 26, 40, 41, 42]} | 1 |
construct-rlve-maximum-clique-l5-s1 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 5 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 44 vertices labelled 0..43 and edge list
[[0, 2], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 11], [0, 12], [0, 14], [0, 16], [0, 19], [0, 22], [0, 23], [0, 24], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 35], [0, 36], [0, 37], [0, 38], [0, 39], [0... | {"n": 44, "k": 9, "edges": [[0, 2], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 11], [0, 12], [0, 14], [0, 16], [0, 19], [0, 22], [0, 23], [0, 24], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 35], [0, 36], [0, 37], [0, 38], [0, 39], [0, 40], [0, 41], [0, 42], [0, 43], [1, 2], [1,... | null | null | null | {"clique": [0, 2, 4, 8, 22, 26, 29, 37, 40]} | 1 |
construct-rlve-maximum-clique-l5-s2 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 5 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 44 vertices labelled 0..43 and edge list
[[0, 3], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 33], [0, 34], [0, 35], [0, 36], [0, 37], [0, 38],... | {"n": 44, "k": 13, "edges": [[0, 3], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 33], [0, 34], [0, 35], [0, 36], [0, 37], [0, 38], [0, 39], [0, 41], [0, 42], [0, 43], [1, 3],... | null | null | null | {"clique": [3, 5, 10, 18, 25, 31, 32, 35, 37, 38, 40, 41, 42]} | 1 |
construct-rlve-maximum-clique-l5-s3 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 5 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 44 vertices labelled 0..43 and edge list
[[0, 2], [0, 3], [0, 4], [0, 6], [0, 7], [0, 13], [0, 20], [0, 22], [0, 25], [0, 31], [0, 32], [0, 33], [0, 34], [0, 36], [0, 38], [0, 39], [0, 40], [0, 41], [0, 42], [0, 43], [1, 3], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 11], [1, 12], [1, 1... | {"n": 44, "k": 7, "edges": [[0, 2], [0, 3], [0, 4], [0, 6], [0, 7], [0, 13], [0, 20], [0, 22], [0, 25], [0, 31], [0, 32], [0, 33], [0, 34], [0, 36], [0, 38], [0, 39], [0, 40], [0, 41], [0, 42], [0, 43], [1, 3], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 17], [1, 20], [1, 2... | null | null | null | {"clique": [0, 7, 13, 25, 33, 34, 40]} | 1 |
construct-rlve-maximum-clique-l5-s4 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 5 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 44 vertices labelled 0..43 and edge list
[[0, 2], [0, 4], [0, 6], [0, 7], [0, 8], [0, 10], [0, 13], [0, 14], [0, 17], [0, 19], [0, 20], [0, 21], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 32], [0, 33], [0, 34], [0, 35], [0, 36], [0, 37], [0, 43], [1, 2], [... | {"n": 44, "k": 10, "edges": [[0, 2], [0, 4], [0, 6], [0, 7], [0, 8], [0, 10], [0, 13], [0, 14], [0, 17], [0, 19], [0, 20], [0, 21], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 32], [0, 33], [0, 34], [0, 35], [0, 36], [0, 37], [0, 43], [1, 2], [1, 3], [1, 4], [1, 5], [1, 8], [1, 9], [1, 1... | null | null | null | {"clique": [3, 5, 8, 15, 19, 27, 30, 34, 41, 42]} | 1 |
construct-rlve-maximum-clique-l5-s5 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 5 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 44 vertices labelled 0..43 and edge list
[[0, 1], [0, 3], [0, 5], [0, 6], [0, 7], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 27], [0, 29], [0, 32], [0, 33], [0, 34], [0, 35], [0, 36], [0, 37], [0, 39], [0, 40], ... | {"n": 44, "k": 10, "edges": [[0, 1], [0, 3], [0, 5], [0, 6], [0, 7], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 27], [0, 29], [0, 32], [0, 33], [0, 34], [0, 35], [0, 36], [0, 37], [0, 39], [0, 40], [0, 42], [0, 43], [1, 3], [1, 4], [1, 6], [1... | null | null | null | {"clique": [0, 6, 16, 23, 24, 29, 32, 34, 37, 40]} | 1 |
construct-rlve-maximum-clique-l5-s6 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 5 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 44 vertices labelled 0..43 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 22], [0, 23], [0, 24], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 34], [0... | {"n": 44, "k": 9, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 22], [0, 23], [0, 24], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 34], [0, 35], [0, 37], [0, 39], [1, 2], [1, 3], [1, ... | null | null | null | {"clique": [0, 2, 6, 9, 16, 17, 26, 28, 29]} | 1 |
construct-rlve-maximum-clique-l5-s7 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 5 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 44 vertices labelled 0..43 and edge list
[[0, 1], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 32], [0, 33], [0, 36], [... | {"n": 44, "k": 12, "edges": [[0, 1], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 32], [0, 33], [0, 36], [0, 38], [0, 39], [0, 40], [0, 41], [0, 42], ... | null | null | null | {"clique": [1, 2, 6, 15, 22, 23, 25, 34, 35, 38, 41, 43]} | 1 |
construct-rlve-maximum-clique-l5-s8 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 5 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 44 vertices labelled 0..43 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 6], [0, 8], [0, 10], [0, 12], [0, 14], [0, 15], [0, 18], [0, 19], [0, 20], [0, 21], [0, 23], [0, 25], [0, 26], [0, 28], [0, 30], [0, 33], [0, 36], [0, 37], [0, 39], [0, 40], [0, 41], [0, 42], [1, 2], [1, 3], [1,... | {"n": 44, "k": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 6], [0, 8], [0, 10], [0, 12], [0, 14], [0, 15], [0, 18], [0, 19], [0, 20], [0, 21], [0, 23], [0, 25], [0, 26], [0, 28], [0, 30], [0, 33], [0, 36], [0, 37], [0, 39], [0, 40], [0, 41], [0, 42], [1, 2], [1, 3], [1, 4], [1, 5], [1, 7], [1, 8], [1, 9], [1, 10],... | null | null | null | {"clique": [0, 1, 2, 3, 14, 26, 40, 41]} | 1 |
construct-rlve-maximum-clique-l5-s9 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 5 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 44 vertices labelled 0..43 and edge list
[[0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 11], [0, 12], [0, 13], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 33], [0... | {"n": 44, "k": 13, "edges": [[0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 11], [0, 12], [0, 13], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 33], [0, 34], [0, 35], [0, 36], [0, 39], [0, 41], [... | null | null | null | {"clique": [1, 4, 6, 12, 15, 18, 22, 26, 30, 35, 41, 42, 43]} | 1 |
construct-rlve-maximum-clique-l6-s0 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 6 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 56 vertices labelled 0..55 and edge list
[[0, 1], [0, 3], [0, 5], [0, 6], [0, 8], [0, 10], [0, 13], [0, 14], [0, 16], [0, 17], [0, 18], [0, 19], [0, 21], [0, 23], [0, 24], [0, 26], [0, 27], [0, 28], [0, 31], [0, 32], [0, 36], [0, 37], [0, 39], [0, 40], [0, 42], [0, 44], [0, 45], [0, 50], ... | {"n": 56, "k": 10, "edges": [[0, 1], [0, 3], [0, 5], [0, 6], [0, 8], [0, 10], [0, 13], [0, 14], [0, 16], [0, 17], [0, 18], [0, 19], [0, 21], [0, 23], [0, 24], [0, 26], [0, 27], [0, 28], [0, 31], [0, 32], [0, 36], [0, 37], [0, 39], [0, 40], [0, 42], [0, 44], [0, 45], [0, 50], [0, 51], [0, 53], [0, 55], [1, 2], [1, 3], [... | null | null | null | {"clique": [1, 2, 9, 20, 23, 27, 42, 46, 50, 53]} | 1 |
construct-rlve-maximum-clique-l6-s1 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 6 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 56 vertices labelled 0..55 and edge list
[[0, 1], [0, 2], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 13], [0, 14], [0, 17], [0, 21], [0, 22], [0, 24], [0, 25], [0, 26], [0, 27], [0, 30], [0, 32], [0, 36], [0, 38], [0, 39], [0, 41], [0, 42], [0, 45], [0, 46], [0, 48], [0... | {"n": 56, "k": 9, "edges": [[0, 1], [0, 2], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 13], [0, 14], [0, 17], [0, 21], [0, 22], [0, 24], [0, 25], [0, 26], [0, 27], [0, 30], [0, 32], [0, 36], [0, 38], [0, 39], [0, 41], [0, 42], [0, 45], [0, 46], [0, 48], [0, 49], [0, 50], [0, 51], [0, 53], [0, 54], [0... | null | null | null | {"clique": [2, 6, 10, 19, 26, 29, 35, 36, 45]} | 1 |
construct-rlve-maximum-clique-l6-s2 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 6 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 56 vertices labelled 0..55 and edge list
[[0, 1], [0, 4], [0, 5], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 15], [0, 17], [0, 18], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 26], [0, 30], [0, 31], [0, 32], [0, 34], [0, 35], [0, 36], [0, 38], [0, 39], [0, 40], [0, 42], [0, 43],... | {"n": 56, "k": 10, "edges": [[0, 1], [0, 4], [0, 5], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 15], [0, 17], [0, 18], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 26], [0, 30], [0, 31], [0, 32], [0, 34], [0, 35], [0, 36], [0, 38], [0, 39], [0, 40], [0, 42], [0, 43], [0, 45], [0, 46], [0, 47], [0, 50], [0, 51]... | null | null | null | {"clique": [1, 10, 16, 26, 29, 38, 41, 48, 51, 55]} | 1 |
construct-rlve-maximum-clique-l6-s3 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 6 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 56 vertices labelled 0..55 and edge list
[[0, 1], [0, 2], [0, 4], [0, 8], [0, 9], [0, 13], [0, 14], [0, 15], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 36], [0, 40], [0, 41], [0, 42], ... | {"n": 56, "k": 12, "edges": [[0, 1], [0, 2], [0, 4], [0, 8], [0, 9], [0, 13], [0, 14], [0, 15], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 36], [0, 40], [0, 41], [0, 42], [0, 45], [0, 46], [0, 48], [0, 49], [0, 50],... | null | null | null | {"clique": [0, 1, 2, 4, 13, 15, 20, 21, 24, 32, 40, 53]} | 1 |
construct-rlve-maximum-clique-l6-s4 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 6 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 56 vertices labelled 0..55 and edge list
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 10], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 32], [0, 33], [0, 34], [0, 35], [0, 36], [... | {"n": 56, "k": 13, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 10], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 32], [0, 33], [0, 34], [0, 35], [0, 36], [0, 38], [0, 39], [0, 40], [0, 41], [0, 43], ... | null | null | null | {"clique": [0, 5, 12, 16, 22, 30, 34, 36, 38, 43, 44, 47, 52]} | 1 |
construct-rlve-maximum-clique-l6-s5 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 6 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 56 vertices labelled 0..55 and edge list
[[0, 1], [0, 4], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 13], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 28], [0, 29], [0, 31], [0, 32], [0, 34], [0, 36], [0, 38], [0, 39], [... | {"n": 56, "k": 12, "edges": [[0, 1], [0, 4], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 13], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 28], [0, 29], [0, 31], [0, 32], [0, 34], [0, 36], [0, 38], [0, 39], [0, 40], [0, 41], [0, 42], [0, 43], [0, 44], ... | null | null | null | {"clique": [0, 7, 10, 13, 16, 20, 22, 38, 40, 49, 52, 53]} | 1 |
construct-rlve-maximum-clique-l6-s6 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 6 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 56 vertices labelled 0..55 and edge list
[[0, 4], [0, 6], [0, 8], [0, 10], [0, 14], [0, 18], [0, 20], [0, 21], [0, 22], [0, 25], [0, 26], [0, 27], [0, 28], [0, 32], [0, 33], [0, 34], [0, 36], [0, 39], [0, 40], [0, 42], [0, 43], [0, 44], [0, 45], [0, 46], [0, 47], [0, 48], [0, 50], [0, 51]... | {"n": 56, "k": 9, "edges": [[0, 4], [0, 6], [0, 8], [0, 10], [0, 14], [0, 18], [0, 20], [0, 21], [0, 22], [0, 25], [0, 26], [0, 27], [0, 28], [0, 32], [0, 33], [0, 34], [0, 36], [0, 39], [0, 40], [0, 42], [0, 43], [0, 44], [0, 45], [0, 46], [0, 47], [0, 48], [0, 50], [0, 51], [0, 53], [0, 54], [0, 55], [1, 2], [1, 4], ... | null | null | null | {"clique": [2, 8, 9, 20, 21, 27, 35, 52, 55]} | 1 |
construct-rlve-maximum-clique-l6-s7 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 6 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 56 vertices labelled 0..55 and edge list
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 9], [0, 11], [0, 12], [0, 13], [0, 14], [0, 17], [0, 18], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 32], [0, 33], [0, 34], [0, 35], [0, 37], [0... | {"n": 56, "k": 11, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 9], [0, 11], [0, 12], [0, 13], [0, 14], [0, 17], [0, 18], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 32], [0, 33], [0, 34], [0, 35], [0, 37], [0, 38], [0, 41], [0, 42], [0, 43], [0, 44], [... | null | null | null | {"clique": [0, 6, 9, 14, 17, 24, 28, 34, 42, 44, 49]} | 1 |
construct-rlve-maximum-clique-l6-s8 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 6 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 56 vertices labelled 0..55 and edge list
[[0, 1], [0, 2], [0, 4], [0, 5], [0, 6], [0, 8], [0, 10], [0, 11], [0, 12], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 21], [0, 24], [0, 25], [0, 27], [0, 28], [0, 29], [0, 30], [0, 32], [0, 33], [0, 35], [0, 36], [0, 38], [0, 41], [... | {"n": 56, "k": 12, "edges": [[0, 1], [0, 2], [0, 4], [0, 5], [0, 6], [0, 8], [0, 10], [0, 11], [0, 12], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 21], [0, 24], [0, 25], [0, 27], [0, 28], [0, 29], [0, 30], [0, 32], [0, 33], [0, 35], [0, 36], [0, 38], [0, 41], [0, 43], [0, 45], [0, 46], [0, 48], [0, 49], ... | null | null | null | {"clique": [1, 2, 13, 16, 26, 27, 33, 38, 40, 45, 46, 49]} | 1 |
construct-rlve-maximum-clique-l6-s9 | construct | rlve_maximum_clique | maximum_clique | graph_theory | competition | 6 | RLVE-Gym/maximum_clique | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 56 vertices labelled 0..55 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 12], [0, 13], [0, 14], [0, 16], [0, 17], [0, 18], [0, 22], [0, 23], [0, 24], [0, 27], [0, 28], [0, 30], [0, 31], [0, 32], [0, 35], [0, 37], [0, 42], [0, 43], [0, 45], [0, ... | {"n": 56, "k": 9, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 12], [0, 13], [0, 14], [0, 16], [0, 17], [0, 18], [0, 22], [0, 23], [0, 24], [0, 27], [0, 28], [0, 30], [0, 31], [0, 32], [0, 35], [0, 37], [0, 42], [0, 43], [0, 45], [0, 48], [0, 49], [0, 50], [0, 51], [0, 52], [0, ... | null | null | null | {"clique": [0, 3, 14, 16, 17, 24, 32, 37, 52]} | 1 |
construct-rlve-min-chromatic-number-l1-s0 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 1 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[0, 3], [1, 4], [2, 3], [2, 5], [3, 4], [3, 5]]
Its chromatic number is 3. Give a proper colouring with colours 0..2: every vertex gets a colour in {0, ..., 2} and adjacent vertices get different colours.
Answer format: {"colors": [c_0, ..., c_5]}... | {"n": 6, "k": 3, "edges": [[0, 3], [1, 4], [2, 3], [2, 5], [3, 4], [3, 5]], "family": "rlve_min_chromatic_number", "subset": "construct"} | null | null | null | {"colors": [0, 0, 0, 1, 2, 2]} | 1 |
construct-rlve-min-chromatic-number-l1-s1 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 1 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[0, 1], [0, 3], [1, 3], [2, 4], [2, 5], [3, 5]]
Its chromatic number is 3. Give a proper colouring with colours 0..2: every vertex gets a colour in {0, ..., 2} and adjacent vertices get different colours.
Answer format: {"colors": [c_0, ..., c_5]}... | {"n": 6, "k": 3, "edges": [[0, 1], [0, 3], [1, 3], [2, 4], [2, 5], [3, 5]], "family": "rlve_min_chromatic_number", "subset": "construct"} | null | null | null | {"colors": [0, 1, 0, 2, 1, 1]} | 1 |
construct-rlve-min-chromatic-number-l1-s2 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 1 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[0, 1], [0, 3], [0, 5], [2, 3], [3, 5]]
Its chromatic number is 3. Give a proper colouring with colours 0..2: every vertex gets a colour in {0, ..., 2} and adjacent vertices get different colours.
Answer format: {"colors": [c_0, ..., c_5]}
Write ... | {"n": 6, "k": 3, "edges": [[0, 1], [0, 3], [0, 5], [2, 3], [3, 5]], "family": "rlve_min_chromatic_number", "subset": "construct"} | null | null | null | {"colors": [0, 1, 0, 1, 0, 2]} | 1 |
construct-rlve-min-chromatic-number-l1-s3 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 1 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[0, 2], [0, 3], [2, 3]]
Its chromatic number is 3. Give a proper colouring with colours 0..2: every vertex gets a colour in {0, ..., 2} and adjacent vertices get different colours.
Answer format: {"colors": [c_0, ..., c_5]}
Write your final answe... | {"n": 6, "k": 3, "edges": [[0, 2], [0, 3], [2, 3]], "family": "rlve_min_chromatic_number", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 2, 0, 0]} | 1 |
construct-rlve-min-chromatic-number-l1-s4 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 1 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[0, 2], [1, 2], [1, 3], [1, 5], [2, 4], [2, 5], [3, 4], [3, 5], [4, 5]]
Its chromatic number is 3. Give a proper colouring with colours 0..2: every vertex gets a colour in {0, ..., 2} and adjacent vertices get different colours.
Answer format: {"c... | {"n": 6, "k": 3, "edges": [[0, 2], [1, 2], [1, 3], [1, 5], [2, 4], [2, 5], [3, 4], [3, 5], [4, 5]], "family": "rlve_min_chromatic_number", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 1, 0, 2]} | 1 |
construct-rlve-min-chromatic-number-l1-s5 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 1 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[3, 4], [3, 5], [4, 5]]
Its chromatic number is 3. Give a proper colouring with colours 0..2: every vertex gets a colour in {0, ..., 2} and adjacent vertices get different colours.
Answer format: {"colors": [c_0, ..., c_5]}
Write your final answe... | {"n": 6, "k": 3, "edges": [[3, 4], [3, 5], [4, 5]], "family": "rlve_min_chromatic_number", "subset": "construct"} | null | null | null | {"colors": [0, 0, 0, 0, 1, 2]} | 1 |
construct-rlve-min-chromatic-number-l1-s6 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 1 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[0, 3], [0, 4], [0, 5], [1, 2], [1, 5], [2, 3], [2, 4], [2, 5], [3, 4], [3, 5], [4, 5]]
Its chromatic number is 4. Give a proper colouring with colours 0..3: every vertex gets a colour in {0, ..., 3} and adjacent vertices get different colours.
An... | {"n": 6, "k": 4, "edges": [[0, 3], [0, 4], [0, 5], [1, 2], [1, 5], [2, 3], [2, 4], [2, 5], [3, 4], [3, 5], [4, 5]], "family": "rlve_min_chromatic_number", "subset": "construct"} | null | null | null | {"colors": [0, 1, 0, 1, 2, 3]} | 1 |
construct-rlve-min-chromatic-number-l1-s7 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 1 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[0, 2], [0, 5], [2, 5]]
Its chromatic number is 3. Give a proper colouring with colours 0..2: every vertex gets a colour in {0, ..., 2} and adjacent vertices get different colours.
Answer format: {"colors": [c_0, ..., c_5]}
Write your final answe... | {"n": 6, "k": 3, "edges": [[0, 2], [0, 5], [2, 5]], "family": "rlve_min_chromatic_number", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 0, 0, 2]} | 1 |
construct-rlve-min-chromatic-number-l1-s8 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 1 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[0, 1], [0, 3], [1, 3], [3, 4], [3, 5]]
Its chromatic number is 3. Give a proper colouring with colours 0..2: every vertex gets a colour in {0, ..., 2} and adjacent vertices get different colours.
Answer format: {"colors": [c_0, ..., c_5]}
Write ... | {"n": 6, "k": 3, "edges": [[0, 1], [0, 3], [1, 3], [3, 4], [3, 5]], "family": "rlve_min_chromatic_number", "subset": "construct"} | null | null | null | {"colors": [0, 1, 0, 2, 0, 0]} | 1 |
construct-rlve-min-chromatic-number-l1-s9 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 1 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 6 vertices labelled 0..5 and edge list
[[0, 2], [0, 3], [0, 4], [0, 5], [1, 4], [1, 5], [2, 3], [2, 5], [3, 4], [3, 5], [4, 5]]
Its chromatic number is 4. Give a proper colouring with colours 0..3: every vertex gets a colour in {0, ..., 3} and adjacent vertices get different colours.
An... | {"n": 6, "k": 4, "edges": [[0, 2], [0, 3], [0, 4], [0, 5], [1, 4], [1, 5], [2, 3], [2, 5], [3, 4], [3, 5], [4, 5]], "family": "rlve_min_chromatic_number", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 2, 1, 3]} | 1 |
construct-rlve-min-chromatic-number-l2-s0 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 2 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 3], [0, 5], [0, 6], [0, 7], [1, 2], [1, 8], [2, 8], [3, 8], [5, 8], [5, 9], [6, 7]]
Its chromatic number is 3. Give a proper colouring with colours 0..2: every vertex gets a colour in {0, ..., 2} and adjacent vertices get different colours.
A... | {"n": 10, "k": 3, "edges": [[0, 3], [0, 5], [0, 6], [0, 7], [1, 2], [1, 8], [2, 8], [3, 8], [5, 8], [5, 9], [6, 7]], "family": "rlve_min_chromatic_number", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 1, 0, 1, 1, 2, 2, 0]} | 1 |
construct-rlve-min-chromatic-number-l2-s1 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 2 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 1], [0, 2], [0, 4], [0, 6], [0, 7], [0, 8], [0, 9], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [3, 4], [3, 5], [3, 6], [4, 6], [4, 8], [5, 6], [5, 9], [6, 7], [6, 8], [6, 9], [7, 8], ... | {"n": 10, "k": 7, "edges": [[0, 1], [0, 2], [0, 4], [0, 6], [0, 7], [0, 8], [0, 9], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [3, 4], [3, 5], [3, 6], [4, 6], [4, 8], [5, 6], [5, 9], [6, 7], [6, 8], [6, 9], [7, 8], [7, 9], [8, 9]], "family": "rlve_min_chromat... | null | null | null | {"colors": [0, 1, 2, 0, 3, 3, 4, 3, 5, 6]} | 1 |
construct-rlve-min-chromatic-number-l2-s2 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 2 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 3], [0, 5], [0, 7], [0, 8], [1, 4], [1, 6], [2, 3], [2, 4], [2, 5], [2, 6], [2, 8], [2, 9], [3, 4], [3, 7], [3, 8], [3, 9], [4, 5], [5, 7], [5, 8], [6, 7], [6, 9], [7, 8], [7, 9], [8, 9]]
Its chromatic number is 4. Give a proper colouring with... | {"n": 10, "k": 4, "edges": [[0, 3], [0, 5], [0, 7], [0, 8], [1, 4], [1, 6], [2, 3], [2, 4], [2, 5], [2, 6], [2, 8], [2, 9], [3, 4], [3, 7], [3, 8], [3, 9], [4, 5], [5, 7], [5, 8], [6, 7], [6, 9], [7, 8], [7, 9], [8, 9]], "family": "rlve_min_chromatic_number", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 2, 3, 2, 2, 1, 3, 0]} | 1 |
construct-rlve-min-chromatic-number-l2-s3 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 2 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 9], [2, 3], [2, 4], [2, 5], [2, 6], [2, 9], [3, 5], [3, 6], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [5, 6], [5, 8], [5, 9], [6, 8], [7, 8], ... | {"n": 10, "k": 5, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 9], [2, 3], [2, 4], [2, 5], [2, 6], [2, 9], [3, 5], [3, 6], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [5, 6], [5, 8], [5, 9], [6, 8], [7, 8], [7, 9], [8, 9]], "family": "rlve_min_chromat... | null | null | null | {"colors": [0, 1, 0, 2, 2, 3, 4, 0, 1, 4]} | 1 |
construct-rlve-min-chromatic-number-l2-s4 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 2 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 1], [0, 2], [0, 4], [0, 7], [1, 4], [1, 5], [1, 6], [1, 8], [2, 3], [2, 7], [2, 8], [2, 9], [3, 4], [3, 5], [3, 9], [4, 6], [4, 8], [4, 9], [6, 8], [6, 9]]
Its chromatic number is 4. Give a proper colouring with colours 0..3: every vertex gets... | {"n": 10, "k": 4, "edges": [[0, 1], [0, 2], [0, 4], [0, 7], [1, 4], [1, 5], [1, 6], [1, 8], [2, 3], [2, 7], [2, 8], [2, 9], [3, 4], [3, 5], [3, 9], [4, 6], [4, 8], [4, 9], [6, 8], [6, 9]], "family": "rlve_min_chromatic_number", "subset": "construct"} | null | null | null | {"colors": [0, 1, 1, 0, 2, 2, 0, 2, 3, 3]} | 1 |
construct-rlve-min-chromatic-number-l2-s5 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 2 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [1, 3], [1, 4], [1, 5], [1, 8], [1, 9], [2, 3], [2, 4], [2, 6], [2, 7], [2, 9], [3, 6], [3, 7], [3, 8], [3, 9], [4, 5], [4, 7], [4, 8], [4, 9], [5, 6], [5, 9], [6, 7], [7, 8], [7, 9]]
Its chromatic n... | {"n": 10, "k": 4, "edges": [[0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [1, 3], [1, 4], [1, 5], [1, 8], [1, 9], [2, 3], [2, 4], [2, 6], [2, 7], [2, 9], [3, 6], [3, 7], [3, 8], [3, 9], [4, 5], [4, 7], [4, 8], [4, 9], [5, 6], [5, 9], [6, 7], [7, 8], [7, 9]], "family": "rlve_min_chromatic_number", "subset": "construct... | null | null | null | {"colors": [0, 0, 0, 1, 1, 2, 3, 2, 3, 3]} | 1 |
construct-rlve-min-chromatic-number-l2-s6 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 2 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [2, 3], [2, 5], [2, 6], [2, 9], [3, 4], [3, 5], [3, 6], [3, 7], [3, 9], [4, 7], [4, 8], [4, 9], [5, 6], [5, 7], [5, 9], [6, 7], ... | {"n": 10, "k": 6, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [2, 3], [2, 5], [2, 6], [2, 9], [3, 4], [3, 5], [3, 6], [3, 7], [3, 9], [4, 7], [4, 8], [4, 9], [5, 6], [5, 7], [5, 9], [6, 7], [7, 8], [7, 9]], "family": "rlve_min_chromat... | null | null | null | {"colors": [0, 1, 2, 3, 4, 4, 5, 2, 3, 0]} | 1 |
construct-rlve-min-chromatic-number-l2-s7 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 2 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 7], [0, 8], [0, 9], [1, 2], [1, 4], [1, 7], [1, 9], [3, 4], [3, 6], [3, 7], [3, 8], [4, 5], [4, 8], [5, 6], [5, 9], [7, 8]]
Its chromatic number is 4. Give a proper colouring with colours 0..3: every vertex gets... | {"n": 10, "k": 4, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 7], [0, 8], [0, 9], [1, 2], [1, 4], [1, 7], [1, 9], [3, 4], [3, 6], [3, 7], [3, 8], [4, 5], [4, 8], [5, 6], [5, 9], [7, 8]], "family": "rlve_min_chromatic_number", "subset": "construct"} | null | null | null | {"colors": [0, 1, 2, 1, 0, 1, 0, 2, 3, 2]} | 1 |
construct-rlve-min-chromatic-number-l2-s8 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 2 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 1], [0, 5], [0, 6], [2, 3], [2, 7], [2, 8], [3, 5], [3, 8], [4, 7], [4, 9], [7, 9]]
Its chromatic number is 3. Give a proper colouring with colours 0..2: every vertex gets a colour in {0, ..., 2} and adjacent vertices get different colours.
A... | {"n": 10, "k": 3, "edges": [[0, 1], [0, 5], [0, 6], [2, 3], [2, 7], [2, 8], [3, 5], [3, 8], [4, 7], [4, 9], [7, 9]], "family": "rlve_min_chromatic_number", "subset": "construct"} | null | null | null | {"colors": [0, 1, 0, 1, 0, 2, 1, 1, 2, 2]} | 1 |
construct-rlve-min-chromatic-number-l2-s9 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 2 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 10 vertices labelled 0..9 and edge list
[[0, 4], [0, 5], [0, 7], [0, 8], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [2, 3], [2, 4], [2, 5], [2, 7], [2, 8], [2, 9], [3, 4], [3, 7], [3, 8], [4, 6], [4, 7], [4, 9], [5, 6], [5, 7], [5, 8], [6, 7], [6, 8], [6, 9], [7, 8], ... | {"n": 10, "k": 5, "edges": [[0, 4], [0, 5], [0, 7], [0, 8], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [2, 3], [2, 4], [2, 5], [2, 7], [2, 8], [2, 9], [3, 4], [3, 7], [3, 8], [4, 6], [4, 7], [4, 9], [5, 6], [5, 7], [5, 8], [6, 7], [6, 8], [6, 9], [7, 8], [7, 9], [8, 9]], "family": "rlve_min_chromat... | null | null | null | {"colors": [0, 0, 1, 2, 3, 2, 1, 4, 3, 2]} | 1 |
construct-rlve-min-chromatic-number-l3-s0 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 3 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 10], [1, 12], [2, 3], [2, 5], [2, 6], [2, 7], [2, 8], [2, 10], [2, 13], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8],... | {"n": 14, "k": 6, "edges": [[0, 1], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 10], [1, 12], [2, 3], [2, 5], [2, 6], [2, 7], [2, 8], [2, 10], [2, 13], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 11], [3, 12], [3, 13], [4, 5], [... | null | null | null | {"colors": [0, 1, 1, 0, 2, 3, 4, 5, 3, 1, 4, 3, 4, 2]} | 1 |
construct-rlve-min-chromatic-number-l3-s1 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 3 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 2], [1, 3], [1, 4], [1, 5], [2, 6], [2, 7], [3, 4], [3, 5], [3, 6], [3, 8], [4, 10], [4, 12], [4, 13], [6, 11], [6, 12], [7, 9], [7, 12], [8, 9], [8, 13], [9, 12], [10, 11], [12, 13]]
Its chromatic number is 3. Give a proper colouring with co... | {"n": 14, "k": 3, "edges": [[0, 2], [1, 3], [1, 4], [1, 5], [2, 6], [2, 7], [3, 4], [3, 5], [3, 6], [3, 8], [4, 10], [4, 12], [4, 13], [6, 11], [6, 12], [7, 9], [7, 12], [8, 9], [8, 13], [9, 12], [10, 11], [12, 13]], "family": "rlve_min_chromatic_number", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 1, 2, 2, 0, 2, 2, 0, 0, 1, 1, 0]} | 1 |
construct-rlve-min-chromatic-number-l3-s2 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 3 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 6], [1, 2], [1, 5], [1, 11], [1, 12], [2, 8], [3, 4], [3, 5], [3, 7], [3, 8], [3, 10], [3, 12], [4, 6], [4, 7], [5, 11], [6, 7], [6, 9], [7, 11], [7, 13], [8, 10], [9, 13], [10, 12]]
Its chromatic number is 3. Give a proper colouring with col... | {"n": 14, "k": 3, "edges": [[0, 6], [1, 2], [1, 5], [1, 11], [1, 12], [2, 8], [3, 4], [3, 5], [3, 7], [3, 8], [3, 10], [3, 12], [4, 6], [4, 7], [5, 11], [6, 7], [6, 9], [7, 11], [7, 13], [8, 10], [9, 13], [10, 12]], "family": "rlve_min_chromatic_number", "subset": "construct"} | null | null | null | {"colors": [0, 0, 1, 1, 0, 2, 1, 2, 2, 0, 0, 1, 2, 1]} | 1 |
construct-rlve-min-chromatic-number-l3-s3 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 3 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 2], [0, 3], [0, 4], [0, 5], [1, 2], [1, 9], [1, 12], [2, 8], [2, 9], [3, 6], [3, 7], [3, 9], [3, 10], [3, 12], [4, 6], [4, 10], [5, 6], [5, 7], [6, 7], [6, 12], [7, 9], [8, 11]]
Its chromatic number is 3. Give a proper colouring with colours ... | {"n": 14, "k": 3, "edges": [[0, 2], [0, 3], [0, 4], [0, 5], [1, 2], [1, 9], [1, 12], [2, 8], [2, 9], [3, 6], [3, 7], [3, 9], [3, 10], [3, 12], [4, 6], [4, 10], [5, 6], [5, 7], [6, 7], [6, 12], [7, 9], [8, 11]], "family": "rlve_min_chromatic_number", "subset": "construct"} | null | null | null | {"colors": [0, 1, 2, 1, 1, 1, 0, 2, 0, 0, 0, 1, 2, 0]} | 1 |
construct-rlve-min-chromatic-number-l3-s4 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 3 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 10], [0, 12], [0, 13], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 11], [1, 12], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 10], [2, 11], [3, 4], [3, 5], [3, 6], [3, 7],... | {"n": 14, "k": 7, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 10], [0, 12], [0, 13], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 11], [1, 12], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 10], [2, 11], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [... | null | null | null | {"colors": [0, 1, 0, 1, 2, 3, 2, 4, 2, 0, 5, 4, 6, 3]} | 1 |
construct-rlve-min-chromatic-number-l3-s5 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 3 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 11], [0, 12], [0, 13], [1, 4], [1, 6], [1, 7], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, ... | {"n": 14, "k": 6, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 11], [0, 12], [0, 13], [1, 4], [1, 6], [1, 7], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 11], [3, 12], [4, 5], [4, 6], [4, 7], [4, 8],... | null | null | null | {"colors": [0, 1, 1, 2, 3, 1, 4, 5, 0, 2, 4, 4, 3, 5]} | 1 |
construct-rlve-min-chromatic-number-l3-s6 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 3 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 3], [0, 5], [0, 7], [0, 9], [0, 10], [0, 11], [1, 3], [1, 8], [1, 9], [1, 11], [1, 13], [2, 5], [2, 10], [2, 11], [2, 12], [3, 4], [3, 5], [3, 11], [3, 12], [3, 13], [4, 5], [4, 8], [4, 10], [4, 12], [4, 13], [5, 7], [6, 8], [6, 10], [6, 13], ... | {"n": 14, "k": 4, "edges": [[0, 3], [0, 5], [0, 7], [0, 9], [0, 10], [0, 11], [1, 3], [1, 8], [1, 9], [1, 11], [1, 13], [2, 5], [2, 10], [2, 11], [2, 12], [3, 4], [3, 5], [3, 11], [3, 12], [3, 13], [4, 5], [4, 8], [4, 10], [4, 12], [4, 13], [5, 7], [6, 8], [6, 10], [6, 13], [7, 9], [7, 11], [7, 13], [8, 9], [8, 10], [8... | null | null | null | {"colors": [0, 0, 0, 1, 0, 2, 0, 1, 1, 2, 2, 3, 3, 2]} | 1 |
construct-rlve-min-chromatic-number-l3-s7 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 3 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 2], [0, 4], [0, 5], [0, 8], [0, 10], [0, 11], [0, 12], [0, 13], [1, 2], [1, 3], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 13], [2, 3], [2, 4], [2, 5], [2, 6], [2, 8], [2, 9], [2, 11], [2, 12], [2, 13], [3, 4], [3, 5], [3, 6]... | {"n": 14, "k": 7, "edges": [[0, 1], [0, 2], [0, 4], [0, 5], [0, 8], [0, 10], [0, 11], [0, 12], [0, 13], [1, 2], [1, 3], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 13], [2, 3], [2, 4], [2, 5], [2, 6], [2, 8], [2, 9], [2, 11], [2, 12], [2, 13], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 10], [3, 12], [3, 13], ... | null | null | null | {"colors": [0, 1, 2, 0, 1, 3, 4, 2, 5, 0, 3, 6, 5, 6]} | 1 |
construct-rlve-min-chromatic-number-l3-s8 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 3 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 9], [0, 10], [0, 12], [1, 2], [1, 3], [1, 9], [1, 11], [1, 12], [2, 4], [2, 10], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 13], [4, 5], [4, 7], [4, 8], [4, 9], [4, 12], [5, 6], [5, 8], [5, 9],... | {"n": 14, "k": 6, "edges": [[0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 9], [0, 10], [0, 12], [1, 2], [1, 3], [1, 9], [1, 11], [1, 12], [2, 4], [2, 10], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 13], [4, 5], [4, 7], [4, 8], [4, 9], [4, 12], [5, 6], [5, 8], [5, 9], [5, 11], [5, 13], [6, 7], [6, 9], [6, 12], [... | null | null | null | {"colors": [0, 0, 1, 1, 2, 1, 2, 3, 0, 4, 2, 2, 1, 5]} | 1 |
construct-rlve-min-chromatic-number-l3-s9 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 3 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 14 vertices labelled 0..13 and edge list
[[0, 1], [0, 4], [0, 6], [0, 7], [1, 3], [1, 7], [1, 9], [1, 12], [1, 13], [2, 3], [2, 5], [2, 7], [2, 8], [2, 9], [2, 11], [3, 4], [3, 7], [3, 10], [4, 5], [4, 6], [4, 9], [5, 6], [5, 7], [5, 10], [5, 11], [6, 7], [6, 12], [7, 8], [7, 10], [7, 11]... | {"n": 14, "k": 4, "edges": [[0, 1], [0, 4], [0, 6], [0, 7], [1, 3], [1, 7], [1, 9], [1, 12], [1, 13], [2, 3], [2, 5], [2, 7], [2, 8], [2, 9], [2, 11], [3, 4], [3, 7], [3, 10], [4, 5], [4, 6], [4, 9], [5, 6], [5, 7], [5, 10], [5, 11], [6, 7], [6, 12], [7, 8], [7, 10], [7, 11], [7, 13], [8, 10], [8, 11], [8, 13], [9, 11]... | null | null | null | {"colors": [0, 1, 0, 2, 3, 2, 1, 3, 2, 2, 0, 1, 2, 0]} | 1 |
construct-rlve-min-chromatic-number-l4-s0 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 4 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 18 vertices labelled 0..17 and edge list
[[0, 1], [0, 3], [0, 5], [0, 6], [0, 8], [0, 10], [0, 11], [0, 12], [0, 16], [1, 3], [1, 4], [1, 6], [1, 7], [1, 11], [1, 12], [1, 13], [1, 16], [1, 17], [2, 3], [2, 6], [2, 9], [2, 12], [2, 17], [3, 4], [3, 7], [3, 13], [3, 14], [3, 15], [4, 6], [... | {"n": 18, "k": 4, "edges": [[0, 1], [0, 3], [0, 5], [0, 6], [0, 8], [0, 10], [0, 11], [0, 12], [0, 16], [1, 3], [1, 4], [1, 6], [1, 7], [1, 11], [1, 12], [1, 13], [1, 16], [1, 17], [2, 3], [2, 6], [2, 9], [2, 12], [2, 17], [3, 4], [3, 7], [3, 13], [3, 14], [3, 15], [4, 6], [4, 9], [4, 13], [5, 10], [5, 13], [5, 14], [5... | null | null | null | {"colors": [0, 1, 0, 2, 0, 1, 2, 0, 1, 1, 2, 2, 2, 3, 0, 0, 2, 3]} | 1 |
construct-rlve-min-chromatic-number-l4-s1 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 4 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 18 vertices labelled 0..17 and edge list
[[0, 1], [0, 6], [0, 7], [0, 9], [0, 10], [0, 11], [0, 13], [0, 15], [0, 16], [1, 3], [1, 7], [1, 9], [1, 10], [1, 12], [1, 16], [1, 17], [2, 5], [2, 9], [2, 12], [2, 13], [2, 15], [2, 17], [3, 4], [3, 5], [3, 6], [3, 9], [3, 10], [3, 13], [3, 14],... | {"n": 18, "k": 5, "edges": [[0, 1], [0, 6], [0, 7], [0, 9], [0, 10], [0, 11], [0, 13], [0, 15], [0, 16], [1, 3], [1, 7], [1, 9], [1, 10], [1, 12], [1, 16], [1, 17], [2, 5], [2, 9], [2, 12], [2, 13], [2, 15], [2, 17], [3, 4], [3, 5], [3, 6], [3, 9], [3, 10], [3, 13], [3, 14], [3, 16], [4, 5], [4, 7], [4, 10], [4, 16], [... | null | null | null | {"colors": [0, 1, 0, 0, 1, 2, 3, 3, 0, 4, 2, 1, 3, 1, 1, 1, 4, 2]} | 1 |
construct-rlve-min-chromatic-number-l4-s2 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 4 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 18 vertices labelled 0..17 and edge list
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 12], [0, 13], [0, 14], [0, 15], [1, 2], [1, 3], [1, 4], [1, 8], [1, 9], [1, 11], [1, 14], [1, 16], [2, 7], [2, 9], [2, 12], [2, 13], [2, 15], [3, 5], [3, 6], [3, 7], [3, ... | {"n": 18, "k": 6, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 12], [0, 13], [0, 14], [0, 15], [1, 2], [1, 3], [1, 4], [1, 8], [1, 9], [1, 11], [1, 14], [1, 16], [2, 7], [2, 9], [2, 12], [2, 13], [2, 15], [3, 5], [3, 6], [3, 7], [3, 8], [3, 10], [3, 11], [3, 12], [3, 13], [3, 1... | null | null | null | {"colors": [0, 1, 0, 2, 2, 1, 3, 4, 3, 2, 4, 4, 1, 5, 3, 5, 0, 0]} | 1 |
construct-rlve-min-chromatic-number-l4-s3 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 4 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 18 vertices labelled 0..17 and edge list
[[0, 1], [0, 13], [1, 2], [1, 4], [1, 6], [1, 8], [1, 12], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [3, 4], [3, 13], [4, 6], [4, 11], [4, 16], [5, 6], [5, 8], [5, 10], [5, 11], [5, 12], [5, 14], [5, 16], [6, 8], [6, 9], [6, 15], [6, 16], [7, 14... | {"n": 18, "k": 4, "edges": [[0, 1], [0, 13], [1, 2], [1, 4], [1, 6], [1, 8], [1, 12], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [3, 4], [3, 13], [4, 6], [4, 11], [4, 16], [5, 6], [5, 8], [5, 10], [5, 11], [5, 12], [5, 14], [5, 16], [6, 8], [6, 9], [6, 15], [6, 16], [7, 14], [7, 16], [8, 11], [8, 12], [8, 15], [8, 17... | null | null | null | {"colors": [0, 1, 0, 0, 2, 0, 3, 0, 2, 0, 1, 1, 3, 2, 1, 1, 1, 0]} | 1 |
construct-rlve-min-chromatic-number-l4-s4 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 4 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 18 vertices labelled 0..17 and edge list
[[0, 1], [0, 2], [0, 5], [0, 6], [0, 8], [0, 9], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [1, 2], [1, 3], [1, 4], [1, 6], [1, 8], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 16], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2... | {"n": 18, "k": 7, "edges": [[0, 1], [0, 2], [0, 5], [0, 6], [0, 8], [0, 9], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [1, 2], [1, 3], [1, 4], [1, 6], [1, 8], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 16], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, ... | null | null | null | {"colors": [0, 1, 2, 0, 3, 1, 3, 1, 4, 5, 3, 4, 3, 5, 3, 1, 2, 6]} | 1 |
construct-rlve-min-chromatic-number-l4-s5 | construct | rlve_min_chromatic_number | graph_k_coloring_chromatic | graph_theory | competition | 4 | RLVE-Gym/minimum_chromatic_number | MIT | [
"agentic_trivial",
"np_search"
] | An undirected simple graph has 18 vertices labelled 0..17 and edge list
[[0, 5], [0, 6], [0, 9], [0, 13], [0, 14], [0, 16], [0, 17], [1, 3], [1, 7], [1, 8], [1, 9], [1, 10], [1, 13], [2, 4], [2, 7], [2, 9], [2, 10], [3, 8], [3, 10], [3, 11], [3, 12], [3, 13], [3, 15], [4, 6], [4, 9], [4, 16], [5, 7], [5, 9], [5, 11], [... | {"n": 18, "k": 4, "edges": [[0, 5], [0, 6], [0, 9], [0, 13], [0, 14], [0, 16], [0, 17], [1, 3], [1, 7], [1, 8], [1, 9], [1, 10], [1, 13], [2, 4], [2, 7], [2, 9], [2, 10], [3, 8], [3, 10], [3, 11], [3, 12], [3, 13], [3, 15], [4, 6], [4, 9], [4, 16], [5, 7], [5, 9], [5, 11], [5, 16], [6, 11], [7, 8], [7, 10], [8, 10], [8... | null | null | null | {"colors": [0, 0, 0, 1, 2, 2, 1, 1, 3, 1, 2, 0, 0, 3, 1, 0, 3, 2]} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.