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-mc-low-autocorrelation-l3-s6 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 3 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..19] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{20-k-1} seq[i]*seq[i+k] for k = 1..19 and the energy E = sum_k C_k^2.
Find a sequence of length 20 with E <= 49.
Answer format: {"seq": [s_0, s_1, ..., s_19]} with every s_i equal to -1 or 1
Write your final an... | {"n": 20, "bound": 49, "fixed": [], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [-1, -1, -1, -1, -1, 1, 1, -1, -1, -1, 1, -1, 1, -1, 1, 1, -1, 1, 1, -1]} | 1 |
construct-mc-low-autocorrelation-l3-s7 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 3 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..28] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{29-k-1} seq[i]*seq[i+k] for k = 1..28 and the energy E = sum_k C_k^2.
Find a sequence of length 29 with E <= 84.
Answer format: {"seq": [s_0, s_1, ..., s_28]} with every s_i equal to -1 or 1
Write your final an... | {"n": 29, "bound": 84, "fixed": [], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [1, 1, 1, 1, -1, 1, 1, 1, -1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, 1, -1, 1, -1, -1, -1, -1, 1, -1, 1]} | 1 |
construct-mc-low-autocorrelation-l3-s8 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 3 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..22] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{23-k-1} seq[i]*seq[i+k] for k = 1..22 and the energy E = sum_k C_k^2.
Find a sequence of length 23 with E <= 59.
Some values are fixed in advance and your answer must agree with them:
seq[5] = -1, seq[10] = -1, ... | {"n": 23, "bound": 59, "fixed": [["seq", 5, -1], ["seq", 10, -1], ["seq", 13, 1], ["seq", 19, 1], ["c", 12, 0], ["c", 13, -3], ["c", 16, 0], ["c", 19, -1]], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [-1, 1, -1, 1, -1, -1, -1, -1, -1, -1, -1, 1, 1, 1, -1, -1, 1, -1, 1, 1, -1, -1, 1]} | 1 |
construct-mc-low-autocorrelation-l4-s0 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 4 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..25] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{26-k-1} seq[i]*seq[i+k] for k = 1..25 and the energy E = sum_k C_k^2.
Find a sequence of length 26 with E <= 68.
Answer format: {"seq": [s_0, s_1, ..., s_25]} with every s_i equal to -1 or 1
Write your final an... | {"n": 26, "bound": 68, "fixed": [], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [1, -1, -1, 1, 1, 1, 1, -1, -1, 1, 1, 1, 1, 1, 1, 1, -1, -1, 1, -1, -1, 1, -1, 1, -1, 1]} | 1 |
construct-mc-low-autocorrelation-l4-s1 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 4 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..39] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{40-k-1} seq[i]*seq[i+k] for k = 1..39 and the energy E = sum_k C_k^2.
Find a sequence of length 40 with E <= 160.
Answer format: {"seq": [s_0, s_1, ..., s_39]} with every s_i equal to -1 or 1
Write your final a... | {"n": 40, "bound": 160, "fixed": [], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [-1, -1, -1, 1, 1, -1, -1, -1, -1, 1, 1, -1, 1, -1, -1, 1, -1, -1, 1, -1, 1, -1, 1, -1, 1, 1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, -1, -1, -1, -1]} | 1 |
construct-mc-low-autocorrelation-l4-s2 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 4 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..27] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{28-k-1} seq[i]*seq[i+k] for k = 1..27 and the energy E = sum_k C_k^2.
Find a sequence of length 28 with E <= 78.
Answer format: {"seq": [s_0, s_1, ..., s_27]} with every s_i equal to -1 or 1
Write your final an... | {"n": 28, "bound": 78, "fixed": [], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [1, -1, 1, -1, 1, 1, 1, 1, -1, -1, 1, 1, 1, -1, -1, -1, -1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, -1]} | 1 |
construct-mc-low-autocorrelation-l4-s3 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 4 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..35] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{36-k-1} seq[i]*seq[i+k] for k = 1..35 and the energy E = sum_k C_k^2.
Find a sequence of length 36 with E <= 130.
Answer format: {"seq": [s_0, s_1, ..., s_35]} with every s_i equal to -1 or 1
Write your final a... | {"n": 36, "bound": 130, "fixed": [], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [1, -1, 1, 1, -1, 1, -1, -1, 1, -1, 1, -1, 1, -1, -1, -1, 1, -1, -1, 1, 1, 1, 1, 1, 1, 1, -1, -1, 1, 1, 1, 1, -1, -1, 1, 1]} | 1 |
construct-mc-low-autocorrelation-l4-s4 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 4 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..31] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{32-k-1} seq[i]*seq[i+k] for k = 1..31 and the energy E = sum_k C_k^2.
Find a sequence of length 32 with E <= 102.
Answer format: {"seq": [s_0, s_1, ..., s_31]} with every s_i equal to -1 or 1
Write your final a... | {"n": 32, "bound": 102, "fixed": [], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [1, -1, 1, 1, -1, 1, -1, 1, 1, 1, 1, -1, 1, 1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, 1, -1, 1, -1, -1, -1, 1]} | 1 |
construct-mc-low-autocorrelation-l4-s5 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 4 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..29] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{30-k-1} seq[i]*seq[i+k] for k = 1..29 and the energy E = sum_k C_k^2.
Find a sequence of length 30 with E <= 90.
Answer format: {"seq": [s_0, s_1, ..., s_29]} with every s_i equal to -1 or 1
Write your final an... | {"n": 30, "bound": 90, "fixed": [], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [1, -1, 1, -1, 1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1]} | 1 |
construct-mc-low-autocorrelation-l5-s0 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 5 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..35] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{36-k-1} seq[i]*seq[i+k] for k = 1..35 and the energy E = sum_k C_k^2.
Find a sequence of length 36 with E <= 82.
Answer format: {"seq": [s_0, s_1, ..., s_35]} with every s_i equal to -1 or 1
Write your final an... | {"n": 36, "bound": 82, "fixed": [], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [-1, 1, -1, -1, 1, -1, 1, -1, -1, 1, -1, -1, 1, -1, -1, -1, 1, -1, 1, -1, -1, -1, 1, 1, -1, -1, -1, 1, 1, 1, 1, 1, 1, -1, -1, -1]} | 1 |
construct-mc-low-autocorrelation-l5-s1 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 5 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..27] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{28-k-1} seq[i]*seq[i+k] for k = 1..27 and the energy E = sum_k C_k^2.
Find a sequence of length 28 with E <= 50.
Answer format: {"seq": [s_0, s_1, ..., s_27]} with every s_i equal to -1 or 1
Write your final an... | {"n": 28, "bound": 50, "fixed": [], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [1, 1, 1, -1, -1, -1, -1, 1, 1, 1, -1, 1, 1, 1, -1, 1, 1, 1, -1, 1, 1, -1, 1, -1, -1, 1, -1, -1]} | 1 |
construct-mc-low-autocorrelation-l5-s2 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 5 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..39] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{40-k-1} seq[i]*seq[i+k] for k = 1..39 and the energy E = sum_k C_k^2.
Find a sequence of length 40 with E <= 108.
Answer format: {"seq": [s_0, s_1, ..., s_39]} with every s_i equal to -1 or 1
Write your final a... | {"n": 40, "bound": 108, "fixed": [], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [1, 1, 1, 1, -1, -1, -1, -1, 1, 1, 1, 1, -1, 1, 1, -1, 1, -1, -1, 1, -1, -1, -1, 1, -1, 1, 1, -1, 1, 1, 1, -1, 1, 1, 1, -1, 1, 1, 1, -1]} | 1 |
construct-mc-low-autocorrelation-l5-s3 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 5 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..31] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{32-k-1} seq[i]*seq[i+k] for k = 1..31 and the energy E = sum_k C_k^2.
Find a sequence of length 32 with E <= 64.
Answer format: {"seq": [s_0, s_1, ..., s_31]} with every s_i equal to -1 or 1
Write your final an... | {"n": 32, "bound": 64, "fixed": [], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, -1, 1, -1, 1, -1, 1, 1, -1, 1, -1, 1, 1, 1, 1, 1, 1, 1]} | 1 |
construct-mc-low-autocorrelation-l6-s0 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 6 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..43] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{44-k-1} seq[i]*seq[i+k] for k = 1..43 and the energy E = sum_k C_k^2.
Find a sequence of length 44 with E <= 134.
Answer format: {"seq": [s_0, s_1, ..., s_43]} with every s_i equal to -1 or 1
Write your final a... | {"n": 44, "bound": 134, "fixed": [], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, -1, -1, -1, -1, 1, -1, -1, -1, -1, 1, 1, -1, -1, -1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1]} | 1 |
construct-mc-low-autocorrelation-l6-s1 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 6 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..47] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{48-k-1} seq[i]*seq[i+k] for k = 1..47 and the energy E = sum_k C_k^2.
Find a sequence of length 48 with E <= 160.
Answer format: {"seq": [s_0, s_1, ..., s_47]} with every s_i equal to -1 or 1
Write your final a... | {"n": 48, "bound": 160, "fixed": [], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [-1, 1, 1, -1, 1, 1, -1, 1, -1, -1, 1, 1, 1, 1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, 1, -1, 1, -1, 1, -1]} | 1 |
construct-mc-low-autocorrelation-l6-s2 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 6 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..59] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{60-k-1} seq[i]*seq[i+k] for k = 1..59 and the energy E = sum_k C_k^2.
Find a sequence of length 60 with E <= 266.
Answer format: {"seq": [s_0, s_1, ..., s_59]} with every s_i equal to -1 or 1
Write your final a... | {"n": 60, "bound": 266, "fixed": [], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [-1, -1, 1, 1, -1, -1, 1, -1, -1, 1, -1, -1, 1, -1, -1, 1, -1, -1, -1, 1, 1, -1, -1, -1, 1, -1, 1, -1, -1, -1, -1, 1, -1, 1, -1, 1, -1, -1, -1, 1, 1, 1, -1, 1, -1, 1, 1, 1, 1, 1, 1, 1, -1, -1, -1, -1, -1, -1, 1, 1]} | 1 |
construct-mc-low-autocorrelation-l6-s3 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 6 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..55] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{56-k-1} seq[i]*seq[i+k] for k = 1..55 and the energy E = sum_k C_k^2.
Find a sequence of length 56 with E <= 240.
Answer format: {"seq": [s_0, s_1, ..., s_55]} with every s_i equal to -1 or 1
Write your final a... | {"n": 56, "bound": 240, "fixed": [], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [-1, -1, 1, 1, 1, 1, -1, -1, -1, -1, 1, 1, 1, 1, -1, -1, 1, -1, 1, -1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, -1, 1, -1, -1, 1, -1, -1, 1, 1, 1, 1, 1, 1, 1, 1]} | 1 |
construct-mc-low-autocorrelation-l6-s4 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 6 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..51] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{52-k-1} seq[i]*seq[i+k] for k = 1..51 and the energy E = sum_k C_k^2.
Find a sequence of length 52 with E <= 194.
Answer format: {"seq": [s_0, s_1, ..., s_51]} with every s_i equal to -1 or 1
Write your final a... | {"n": 52, "bound": 194, "fixed": [], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [1, -1, 1, -1, 1, 1, -1, 1, -1, 1, -1, 1, 1, -1, 1, 1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, 1, 1, 1, 1]} | 1 |
construct-mc-low-autocorrelation-l6-s5 | construct | mc_low_autocorrelation | low_autocorrelation_binary_sequence | combinatorics | competition | 6 | MathConstraint/low_autocorrelation | CC-BY-4.0 | [
"np_search"
] | For a sequence seq[0..63] with entries in {-1, +1}, define the aperiodic autocorrelations C_k = sum_{i=0}^{64-k-1} seq[i]*seq[i+k] for k = 1..63 and the energy E = sum_k C_k^2.
Find a sequence of length 64 with E <= 328.
Answer format: {"seq": [s_0, s_1, ..., s_63]} with every s_i equal to -1 or 1
Write your final a... | {"n": 64, "bound": 328, "fixed": [], "family": "mc_low_autocorrelation", "subset": "construct"} | null | null | null | {"seq": [-1, 1, -1, 1, -1, 1, -1, 1, -1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, -1, 1, -1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1, 1, -1, 1, -1, -1, 1, 1, 1, -1, -1, 1, 1, 1, -1, -1, -1, -1, -1, -1, -1, 1, 1, 1, 1]} | 1 |
construct-mc-magic-sequence-l1-s0 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 1 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 4 is a sequence x[0], x[1], ..., x[3] of non-negative integers such that for every i in 0..3, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 4.
Answer format: {"x": [x_0, x_1, ..., x_3]}
Write your final answer as JSON to `/workdir/answe... | {"n": 4, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [1, 2, 1, 0]} | 1 |
construct-mc-magic-sequence-l1-s1 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 1 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 7 is a sequence x[0], x[1], ..., x[6] of non-negative integers such that for every i in 0..6, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 7.
Answer format: {"x": [x_0, x_1, ..., x_6]}
Write your final answer as JSON to `/workdir/answe... | {"n": 7, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [3, 2, 1, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l1-s2 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 1 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 5 is a sequence x[0], x[1], ..., x[4] of non-negative integers such that for every i in 0..4, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 5.
Some values are fixed in advance and your answer must agree with them:
x[2] = 2
Answer format... | {"n": 5, "fixed": [["x", 2, 2]], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [2, 1, 2, 0, 0]} | 1 |
construct-mc-magic-sequence-l1-s3 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 1 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 5 is a sequence x[0], x[1], ..., x[4] of non-negative integers such that for every i in 0..4, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 5.
Answer format: {"x": [x_0, x_1, ..., x_4]}
Write your final answer as JSON to `/workdir/answe... | {"n": 5, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [2, 1, 2, 0, 0]} | 1 |
construct-mc-magic-sequence-l2-s0 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 2 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 8 is a sequence x[0], x[1], ..., x[7] of non-negative integers such that for every i in 0..7, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 8.
Answer format: {"x": [x_0, x_1, ..., x_7]}
Write your final answer as JSON to `/workdir/answe... | {"n": 8, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [4, 2, 1, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l2-s1 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 2 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 9 is a sequence x[0], x[1], ..., x[8] of non-negative integers such that for every i in 0..8, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 9.
Answer format: {"x": [x_0, x_1, ..., x_8]}
Write your final answer as JSON to `/workdir/answe... | {"n": 9, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [5, 2, 1, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l2-s2 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 2 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 10 is a sequence x[0], x[1], ..., x[9] of non-negative integers such that for every i in 0..9, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 10.
Answer format: {"x": [x_0, x_1, ..., x_9]}
Write your final answer as JSON to `/workdir/ans... | {"n": 10, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [6, 2, 1, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l2-s3 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 2 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 9 is a sequence x[0], x[1], ..., x[8] of non-negative integers such that for every i in 0..8, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 9.
Some values are fixed in advance and your answer must agree with them:
x[4] = 0
Answer format... | {"n": 9, "fixed": [["x", 4, 0]], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [5, 2, 1, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l3-s0 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 3 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 13 is a sequence x[0], x[1], ..., x[12] of non-negative integers such that for every i in 0..12, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 13.
Some values are fixed in advance and your answer must agree with them:
x[7] = 0, x[11] = 0... | {"n": 13, "fixed": [["x", 7, 0], ["x", 11, 0]], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [9, 2, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l3-s1 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 3 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 14 is a sequence x[0], x[1], ..., x[13] of non-negative integers such that for every i in 0..13, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 14.
Some values are fixed in advance and your answer must agree with them:
x[11] = 0, x[12] = ... | {"n": 14, "fixed": [["x", 11, 0], ["x", 12, 0]], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [10, 2, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l3-s2 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 3 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 11 is a sequence x[0], x[1], ..., x[10] of non-negative integers such that for every i in 0..10, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 11.
Answer format: {"x": [x_0, x_1, ..., x_10]}
Write your final answer as JSON to `/workdir/... | {"n": 11, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [7, 2, 1, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l3-s3 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 3 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 14 is a sequence x[0], x[1], ..., x[13] of non-negative integers such that for every i in 0..13, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 14.
Answer format: {"x": [x_0, x_1, ..., x_13]}
Write your final answer as JSON to `/workdir/... | {"n": 14, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [10, 2, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l3-s4 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 3 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 12 is a sequence x[0], x[1], ..., x[11] of non-negative integers such that for every i in 0..11, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 12.
Answer format: {"x": [x_0, x_1, ..., x_11]}
Write your final answer as JSON to `/workdir/... | {"n": 12, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [8, 2, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l3-s5 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 3 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 16 is a sequence x[0], x[1], ..., x[15] of non-negative integers such that for every i in 0..15, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 16.
Answer format: {"x": [x_0, x_1, ..., x_15]}
Write your final answer as JSON to `/workdir/... | {"n": 16, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [12, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l3-s6 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 3 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 12 is a sequence x[0], x[1], ..., x[11] of non-negative integers such that for every i in 0..11, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 12.
Some values are fixed in advance and your answer must agree with them:
x[7] = 0, x[8] = 1
... | {"n": 12, "fixed": [["x", 7, 0], ["x", 8, 1]], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [8, 2, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l3-s7 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 3 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 15 is a sequence x[0], x[1], ..., x[14] of non-negative integers such that for every i in 0..14, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 15.
Answer format: {"x": [x_0, x_1, ..., x_14]}
Write your final answer as JSON to `/workdir/... | {"n": 15, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [11, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l3-s8 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 3 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 11 is a sequence x[0], x[1], ..., x[10] of non-negative integers such that for every i in 0..10, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 11.
Some values are fixed in advance and your answer must agree with them:
x[4] = 0, x[10] = 0... | {"n": 11, "fixed": [["x", 4, 0], ["x", 10, 0]], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [7, 2, 1, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l3-s9 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 3 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 13 is a sequence x[0], x[1], ..., x[12] of non-negative integers such that for every i in 0..12, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 13.
Answer format: {"x": [x_0, x_1, ..., x_12]}
Write your final answer as JSON to `/workdir/... | {"n": 13, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [9, 2, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l4-s0 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 4 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 20 is a sequence x[0], x[1], ..., x[19] of non-negative integers such that for every i in 0..19, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 20.
Answer format: {"x": [x_0, x_1, ..., x_19]}
Write your final answer as JSON to `/workdir/... | {"n": 20, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [16, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l4-s1 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 4 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 24 is a sequence x[0], x[1], ..., x[23] of non-negative integers such that for every i in 0..23, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 24.
Answer format: {"x": [x_0, x_1, ..., x_23]}
Write your final answer as JSON to `/workdir/... | {"n": 24, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [20, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l4-s2 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 4 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 28 is a sequence x[0], x[1], ..., x[27] of non-negative integers such that for every i in 0..27, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 28.
Answer format: {"x": [x_0, x_1, ..., x_27]}
Write your final answer as JSON to `/workdir/... | {"n": 28, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [24, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l4-s3 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 4 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 40 is a sequence x[0], x[1], ..., x[39] of non-negative integers such that for every i in 0..39, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 40.
Answer format: {"x": [x_0, x_1, ..., x_39]}
Write your final answer as JSON to `/workdir/... | {"n": 40, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [36, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l4-s4 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 4 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 36 is a sequence x[0], x[1], ..., x[35] of non-negative integers such that for every i in 0..35, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 36.
Answer format: {"x": [x_0, x_1, ..., x_35]}
Write your final answer as JSON to `/workdir/... | {"n": 36, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [32, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l4-s5 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 4 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 32 is a sequence x[0], x[1], ..., x[31] of non-negative integers such that for every i in 0..31, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 32.
Answer format: {"x": [x_0, x_1, ..., x_31]}
Write your final answer as JSON to `/workdir/... | {"n": 32, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [28, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l5-s0 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 5 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 128 is a sequence x[0], x[1], ..., x[127] of non-negative integers such that for every i in 0..127, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 128.
Answer format: {"x": [x_0, x_1, ..., x_127]}
Write your final answer as JSON to `/wor... | {"n": 128, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [124, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,... | 1 |
construct-mc-magic-sequence-l5-s1 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 5 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 81 is a sequence x[0], x[1], ..., x[80] of non-negative integers such that for every i in 0..80, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 81.
Answer format: {"x": [x_0, x_1, ..., x_80]}
Write your final answer as JSON to `/workdir/... | {"n": 81, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [77, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l5-s2 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 5 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 64 is a sequence x[0], x[1], ..., x[63] of non-negative integers such that for every i in 0..63, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 64.
Answer format: {"x": [x_0, x_1, ..., x_63]}
Write your final answer as JSON to `/workdir/... | {"n": 64, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [60, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l5-s3 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 5 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 50 is a sequence x[0], x[1], ..., x[49] of non-negative integers such that for every i in 0..49, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 50.
Answer format: {"x": [x_0, x_1, ..., x_49]}
Write your final answer as JSON to `/workdir/... | {"n": 50, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [46, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-magic-sequence-l5-s4 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 5 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 200 is a sequence x[0], x[1], ..., x[199] of non-negative integers such that for every i in 0..199, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 200.
Answer format: {"x": [x_0, x_1, ..., x_199]}
Write your final answer as JSON to `/wor... | {"n": 200, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [196, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,... | 1 |
construct-mc-magic-sequence-l5-s5 | construct | mc_magic_sequence | magic_sequence | combinatorics | competition | 5 | MathConstraint/magic_sequence | CC-BY-4.0 | [
"agentic_trivial"
] | A magic sequence of length 100 is a sequence x[0], x[1], ..., x[99] of non-negative integers such that for every i in 0..99, x[i] equals the number of times the value i occurs in the sequence.
Find a magic sequence of length 100.
Answer format: {"x": [x_0, x_1, ..., x_99]}
Write your final answer as JSON to `/workdi... | {"n": 100, "fixed": [], "family": "mc_magic_sequence", "subset": "construct"} | null | null | null | {"x": [96, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]} | 1 |
construct-mc-max-clique-l1-s0 | construct | mc_max_clique | graph_clique | graph_theory | competition | 1 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 25 vertices numbered 0..24 and 93 edges:
(0,7), (0,9), (0,10), (0,12), (0,13), (0,19), (0,21), (0,23), (0,24), (1,5), (1,7), (1,8), (1,13), (1,14), (1,15), (1,18), (2,7), (2,9), (2,14), (2,17), (2,19), (2,20), (2,24), (3,5), (3,7), (3,9), (3,15), (3,16), (3,17), (3,19), (4,10), (4,12), (4,18), (4,19), (4,2... | {"n": 25, "k": 5, "edges": [[0, 7], [0, 9], [0, 10], [0, 12], [0, 13], [0, 19], [0, 21], [0, 23], [0, 24], [1, 5], [1, 7], [1, 8], [1, 13], [1, 14], [1, 15], [1, 18], [2, 7], [2, 9], [2, 14], [2, 17], [2, 19], [2, 20], [2, 24], [3, 5], [3, 7], [3, 9], [3, 15], [3, 16], [3, 17], [3, 19], [4, 10], [4, 12], [4, 18], [4, 1... | null | null | null | {"clique": [3, 5, 9, 17, 19]} | 1 |
construct-mc-max-clique-l1-s1 | construct | mc_max_clique | graph_clique | graph_theory | competition | 1 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 25 vertices numbered 0..24 and 101 edges:
(0,2), (0,4), (0,5), (0,7), (0,9), (0,13), (0,14), (0,17), (1,2), (1,6), (1,7), (1,11), (1,14), (1,15), (1,17), (1,20), (1,21), (1,22), (1,24), (2,13), (2,15), (2,23), (3,6), (3,7), (3,8), (3,10), (3,13), (3,14), (4,5), (4,6), (4,7), (4,8), (4,10), (4,13), (4,14), ... | {"n": 25, "k": 5, "edges": [[0, 2], [0, 4], [0, 5], [0, 7], [0, 9], [0, 13], [0, 14], [0, 17], [1, 2], [1, 6], [1, 7], [1, 11], [1, 14], [1, 15], [1, 17], [1, 20], [1, 21], [1, 22], [1, 24], [2, 13], [2, 15], [2, 23], [3, 6], [3, 7], [3, 8], [3, 10], [3, 13], [3, 14], [4, 5], [4, 6], [4, 7], [4, 8], [4, 10], [4, 13], [... | null | null | null | {"clique": [4, 5, 6, 22, 24]} | 1 |
construct-mc-max-clique-l1-s2 | construct | mc_max_clique | graph_clique | graph_theory | competition | 1 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 25 vertices numbered 0..24 and 96 edges:
(0,5), (0,13), (0,16), (0,17), (0,23), (1,6), (1,12), (1,13), (1,14), (1,16), (1,17), (1,18), (1,22), (1,23), (1,24), (2,8), (2,10), (2,11), (2,13), (2,17), (3,4), (3,5), (3,6), (3,10), (3,12), (3,14), (3,16), (3,18), (3,21), (3,22), (4,9), (4,15), (4,16), (4,18), (... | {"n": 25, "k": 5, "edges": [[0, 5], [0, 13], [0, 16], [0, 17], [0, 23], [1, 6], [1, 12], [1, 13], [1, 14], [1, 16], [1, 17], [1, 18], [1, 22], [1, 23], [1, 24], [2, 8], [2, 10], [2, 11], [2, 13], [2, 17], [3, 4], [3, 5], [3, 6], [3, 10], [3, 12], [3, 14], [3, 16], [3, 18], [3, 21], [3, 22], [4, 9], [4, 15], [4, 16], [4... | null | null | null | {"clique": [7, 10, 11, 20, 21]} | 1 |
construct-mc-max-clique-l1-s3 | construct | mc_max_clique | graph_clique | graph_theory | competition | 1 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 25 vertices numbered 0..24 and 93 edges:
(0,2), (0,3), (0,4), (0,5), (0,7), (0,11), (0,12), (0,13), (0,15), (0,16), (0,20), (0,22), (0,23), (1,6), (1,8), (1,12), (1,14), (1,15), (1,16), (1,19), (2,3), (2,10), (2,17), (2,20), (2,23), (3,4), (3,5), (3,7), (3,13), (3,22), (3,23), (3,24), (4,13), (4,23), (5,14... | {"n": 25, "k": 5, "edges": [[0, 2], [0, 3], [0, 4], [0, 5], [0, 7], [0, 11], [0, 12], [0, 13], [0, 15], [0, 16], [0, 20], [0, 22], [0, 23], [1, 6], [1, 8], [1, 12], [1, 14], [1, 15], [1, 16], [1, 19], [2, 3], [2, 10], [2, 17], [2, 20], [2, 23], [3, 4], [3, 5], [3, 7], [3, 13], [3, 22], [3, 23], [3, 24], [4, 13], [4, 23... | null | null | null | {"clique": [6, 7, 8, 13, 17]} | 1 |
construct-mc-max-clique-l1-s4 | construct | mc_max_clique | graph_clique | graph_theory | competition | 1 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 25 vertices numbered 0..24 and 98 edges:
(0,1), (0,2), (0,5), (0,15), (0,20), (0,22), (1,3), (1,7), (1,9), (1,12), (1,15), (1,18), (1,20), (2,5), (2,6), (2,7), (2,8), (2,10), (2,13), (2,14), (2,16), (3,4), (3,11), (3,12), (3,18), (3,20), (3,21), (3,22), (3,23), (4,8), (4,12), (4,18), (4,20), (4,21), (5,8),... | {"n": 25, "k": 5, "edges": [[0, 1], [0, 2], [0, 5], [0, 15], [0, 20], [0, 22], [1, 3], [1, 7], [1, 9], [1, 12], [1, 15], [1, 18], [1, 20], [2, 5], [2, 6], [2, 7], [2, 8], [2, 10], [2, 13], [2, 14], [2, 16], [3, 4], [3, 11], [3, 12], [3, 18], [3, 20], [3, 21], [3, 22], [3, 23], [4, 8], [4, 12], [4, 18], [4, 20], [4, 21]... | null | null | null | {"clique": [2, 6, 7, 10, 16]} | 1 |
construct-mc-max-clique-l1-s5 | construct | mc_max_clique | graph_clique | graph_theory | competition | 1 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 25 vertices numbered 0..24 and 99 edges:
(0,2), (0,3), (0,4), (0,5), (0,8), (0,9), (0,11), (0,13), (0,15), (0,17), (0,21), (0,23), (1,4), (1,6), (1,10), (1,11), (1,12), (1,14), (1,16), (1,20), (1,21), (1,23), (2,10), (2,17), (3,7), (3,10), (3,14), (3,16), (3,18), (3,20), (3,22), (3,23), (3,24), (4,5), (4,7... | {"n": 25, "k": 5, "edges": [[0, 2], [0, 3], [0, 4], [0, 5], [0, 8], [0, 9], [0, 11], [0, 13], [0, 15], [0, 17], [0, 21], [0, 23], [1, 4], [1, 6], [1, 10], [1, 11], [1, 12], [1, 14], [1, 16], [1, 20], [1, 21], [1, 23], [2, 10], [2, 17], [3, 7], [3, 10], [3, 14], [3, 16], [3, 18], [3, 20], [3, 22], [3, 23], [3, 24], [4, ... | null | null | null | {"clique": [0, 4, 5, 9, 21]} | 1 |
construct-mc-max-clique-l1-s6 | construct | mc_max_clique | graph_clique | graph_theory | competition | 1 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 25 vertices numbered 0..24 and 84 edges:
(0,2), (0,7), (0,11), (0,16), (0,19), (0,20), (0,21), (1,3), (1,16), (1,17), (1,22), (1,23), (1,24), (2,4), (2,14), (2,15), (2,17), (3,5), (3,6), (3,8), (3,10), (3,14), (3,19), (3,24), (4,6), (4,16), (4,19), (4,21), (5,6), (5,7), (5,8), (5,11), (5,12), (5,15), (5,17... | {"n": 25, "k": 5, "edges": [[0, 2], [0, 7], [0, 11], [0, 16], [0, 19], [0, 20], [0, 21], [1, 3], [1, 16], [1, 17], [1, 22], [1, 23], [1, 24], [2, 4], [2, 14], [2, 15], [2, 17], [3, 5], [3, 6], [3, 8], [3, 10], [3, 14], [3, 19], [3, 24], [4, 6], [4, 16], [4, 19], [4, 21], [5, 6], [5, 7], [5, 8], [5, 11], [5, 12], [5, 15... | null | null | null | {"clique": [5, 6, 7, 20, 23]} | 1 |
construct-mc-max-clique-l1-s7 | construct | mc_max_clique | graph_clique | graph_theory | competition | 1 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 25 vertices numbered 0..24 and 108 edges:
(0,1), (0,5), (0,7), (0,11), (0,13), (0,16), (0,19), (0,24), (1,3), (1,5), (1,6), (1,7), (1,8), (1,9), (1,10), (1,14), (1,15), (1,18), (1,22), (2,8), (2,10), (2,11), (2,17), (2,19), (2,24), (3,4), (3,6), (3,7), (3,12), (3,14), (3,16), (3,22), (3,23), (4,10), (4,15)... | {"n": 25, "k": 5, "edges": [[0, 1], [0, 5], [0, 7], [0, 11], [0, 13], [0, 16], [0, 19], [0, 24], [1, 3], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 14], [1, 15], [1, 18], [1, 22], [2, 8], [2, 10], [2, 11], [2, 17], [2, 19], [2, 24], [3, 4], [3, 6], [3, 7], [3, 12], [3, 14], [3, 16], [3, 22], [3, 23], [4, 10],... | null | null | null | {"clique": [15, 16, 19, 23, 24]} | 1 |
construct-mc-max-clique-l1-s8 | construct | mc_max_clique | graph_clique | graph_theory | competition | 1 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 25 vertices numbered 0..24 and 105 edges:
(0,1), (0,2), (0,3), (0,8), (0,11), (0,14), (0,17), (0,18), (0,20), (0,21), (0,24), (1,2), (1,5), (1,7), (1,13), (1,17), (1,20), (1,23), (2,3), (2,5), (2,6), (2,7), (2,8), (2,10), (2,13), (2,15), (2,17), (2,20), (2,24), (3,5), (3,6), (3,7), (3,9), (3,11), (3,17), (... | {"n": 25, "k": 5, "edges": [[0, 1], [0, 2], [0, 3], [0, 8], [0, 11], [0, 14], [0, 17], [0, 18], [0, 20], [0, 21], [0, 24], [1, 2], [1, 5], [1, 7], [1, 13], [1, 17], [1, 20], [1, 23], [2, 3], [2, 5], [2, 6], [2, 7], [2, 8], [2, 10], [2, 13], [2, 15], [2, 17], [2, 20], [2, 24], [3, 5], [3, 6], [3, 7], [3, 9], [3, 11], [3... | null | null | null | {"clique": [0, 1, 2, 17, 20]} | 1 |
construct-mc-max-clique-l1-s9 | construct | mc_max_clique | graph_clique | graph_theory | competition | 1 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 25 vertices numbered 0..24 and 99 edges:
(0,6), (0,9), (0,10), (0,18), (0,20), (0,21), (1,2), (1,9), (1,11), (1,14), (1,15), (1,18), (1,21), (2,8), (2,9), (2,13), (2,14), (2,17), (2,19), (2,21), (3,11), (3,17), (3,18), (3,19), (3,21), (3,23), (4,10), (4,12), (4,20), (4,21), (4,24), (5,6), (5,10), (5,13), (... | {"n": 25, "k": 5, "edges": [[0, 6], [0, 9], [0, 10], [0, 18], [0, 20], [0, 21], [1, 2], [1, 9], [1, 11], [1, 14], [1, 15], [1, 18], [1, 21], [2, 8], [2, 9], [2, 13], [2, 14], [2, 17], [2, 19], [2, 21], [3, 11], [3, 17], [3, 18], [3, 19], [3, 21], [3, 23], [4, 10], [4, 12], [4, 20], [4, 21], [4, 24], [5, 6], [5, 10], [5... | null | null | null | {"clique": [5, 13, 16, 17, 19]} | 1 |
construct-mc-max-clique-l2-s0 | construct | mc_max_clique | graph_clique | graph_theory | competition | 2 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 40 vertices numbered 0..39 and 428 edges:
(0,1), (0,3), (0,4), (0,7), (0,10), (0,11), (0,12), (0,14), (0,15), (0,17), (0,19), (0,20), (0,22), (0,23), (0,24), (0,25), (0,29), (0,31), (0,32), (0,33), (0,35), (0,37), (1,3), (1,4), (1,8), (1,10), (1,11), (1,13), (1,16), (1,17), (1,19), (1,21), (1,24), (1,32), ... | {"n": 40, "k": 8, "edges": [[0, 1], [0, 3], [0, 4], [0, 7], [0, 10], [0, 11], [0, 12], [0, 14], [0, 15], [0, 17], [0, 19], [0, 20], [0, 22], [0, 23], [0, 24], [0, 25], [0, 29], [0, 31], [0, 32], [0, 33], [0, 35], [0, 37], [1, 3], [1, 4], [1, 8], [1, 10], [1, 11], [1, 13], [1, 16], [1, 17], [1, 19], [1, 21], [1, 24], [1... | null | null | null | {"clique": [3, 5, 7, 14, 25, 32, 34, 38]} | 1 |
construct-mc-max-clique-l2-s1 | construct | mc_max_clique | graph_clique | graph_theory | competition | 2 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 40 vertices numbered 0..39 and 392 edges:
(0,1), (0,2), (0,4), (0,5), (0,7), (0,8), (0,10), (0,11), (0,17), (0,18), (0,20), (0,21), (0,23), (0,25), (0,26), (0,30), (0,31), (0,33), (0,34), (0,35), (0,36), (0,38), (0,39), (1,2), (1,4), (1,6), (1,7), (1,10), (1,12), (1,13), (1,14), (1,15), (1,16), (1,18), (1,... | {"n": 40, "k": 8, "edges": [[0, 1], [0, 2], [0, 4], [0, 5], [0, 7], [0, 8], [0, 10], [0, 11], [0, 17], [0, 18], [0, 20], [0, 21], [0, 23], [0, 25], [0, 26], [0, 30], [0, 31], [0, 33], [0, 34], [0, 35], [0, 36], [0, 38], [0, 39], [1, 2], [1, 4], [1, 6], [1, 7], [1, 10], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 1... | null | null | null | {"clique": [8, 9, 10, 12, 21, 29, 33, 36]} | 1 |
construct-mc-max-clique-l2-s2 | construct | mc_max_clique | graph_clique | graph_theory | competition | 2 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 40 vertices numbered 0..39 and 400 edges:
(0,1), (0,2), (0,3), (0,4), (0,5), (0,6), (0,7), (0,9), (0,11), (0,12), (0,16), (0,18), (0,20), (0,21), (0,23), (0,24), (0,25), (0,28), (0,30), (0,31), (0,32), (0,35), (0,37), (0,38), (1,6), (1,7), (1,9), (1,11), (1,13), (1,15), (1,16), (1,17), (1,21), (1,22), (1,2... | {"n": 40, "k": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 9], [0, 11], [0, 12], [0, 16], [0, 18], [0, 20], [0, 21], [0, 23], [0, 24], [0, 25], [0, 28], [0, 30], [0, 31], [0, 32], [0, 35], [0, 37], [0, 38], [1, 6], [1, 7], [1, 9], [1, 11], [1, 13], [1, 15], [1, 16], [1, 17], [1, 21], [1, 22... | null | null | null | {"clique": [1, 9, 11, 13, 25, 28, 31, 33]} | 1 |
construct-mc-max-clique-l2-s3 | construct | mc_max_clique | graph_clique | graph_theory | competition | 2 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 40 vertices numbered 0..39 and 391 edges:
(0,3), (0,6), (0,7), (0,8), (0,14), (0,16), (0,21), (0,22), (0,24), (0,31), (0,32), (0,33), (0,35), (0,36), (0,37), (1,2), (1,5), (1,8), (1,16), (1,21), (1,22), (1,23), (1,29), (1,30), (1,33), (1,34), (1,36), (1,37), (1,39), (2,3), (2,4), (2,5), (2,7), (2,11), (2,1... | {"n": 40, "k": 8, "edges": [[0, 3], [0, 6], [0, 7], [0, 8], [0, 14], [0, 16], [0, 21], [0, 22], [0, 24], [0, 31], [0, 32], [0, 33], [0, 35], [0, 36], [0, 37], [1, 2], [1, 5], [1, 8], [1, 16], [1, 21], [1, 22], [1, 23], [1, 29], [1, 30], [1, 33], [1, 34], [1, 36], [1, 37], [1, 39], [2, 3], [2, 4], [2, 5], [2, 7], [2, 11... | null | null | null | {"clique": [3, 4, 6, 18, 21, 22, 27, 38]} | 1 |
construct-mc-max-clique-l2-s4 | construct | mc_max_clique | graph_clique | graph_theory | competition | 2 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 40 vertices numbered 0..39 and 409 edges:
(0,5), (0,6), (0,7), (0,8), (0,9), (0,11), (0,12), (0,13), (0,15), (0,16), (0,19), (0,27), (0,28), (0,30), (0,35), (0,37), (0,38), (1,2), (1,3), (1,4), (1,7), (1,9), (1,10), (1,14), (1,20), (1,23), (1,26), (1,29), (1,30), (1,31), (1,32), (1,34), (1,35), (1,36), (1,... | {"n": 40, "k": 8, "edges": [[0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 11], [0, 12], [0, 13], [0, 15], [0, 16], [0, 19], [0, 27], [0, 28], [0, 30], [0, 35], [0, 37], [0, 38], [1, 2], [1, 3], [1, 4], [1, 7], [1, 9], [1, 10], [1, 14], [1, 20], [1, 23], [1, 26], [1, 29], [1, 30], [1, 31], [1, 32], [1, 34], [1, 35], [1, 3... | null | null | null | {"clique": [9, 12, 13, 16, 18, 22, 24, 36]} | 1 |
construct-mc-max-clique-l2-s5 | construct | mc_max_clique | graph_clique | graph_theory | competition | 2 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 40 vertices numbered 0..39 and 393 edges:
(0,4), (0,5), (0,6), (0,8), (0,9), (0,11), (0,12), (0,15), (0,16), (0,18), (0,20), (0,24), (0,26), (0,27), (0,29), (0,30), (0,33), (0,34), (0,37), (0,39), (1,2), (1,6), (1,7), (1,10), (1,13), (1,14), (1,15), (1,17), (1,18), (1,22), (1,24), (1,25), (1,26), (1,28), (... | {"n": 40, "k": 8, "edges": [[0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 11], [0, 12], [0, 15], [0, 16], [0, 18], [0, 20], [0, 24], [0, 26], [0, 27], [0, 29], [0, 30], [0, 33], [0, 34], [0, 37], [0, 39], [1, 2], [1, 6], [1, 7], [1, 10], [1, 13], [1, 14], [1, 15], [1, 17], [1, 18], [1, 22], [1, 24], [1, 25], [1, 26], [1,... | null | null | null | {"clique": [2, 13, 17, 20, 21, 26, 31, 34]} | 1 |
construct-mc-max-clique-l2-s6 | construct | mc_max_clique | graph_clique | graph_theory | competition | 2 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 40 vertices numbered 0..39 and 398 edges:
(0,1), (0,7), (0,8), (0,9), (0,10), (0,11), (0,12), (0,13), (0,14), (0,16), (0,18), (0,19), (0,23), (0,27), (0,28), (0,29), (0,30), (0,34), (0,37), (1,2), (1,4), (1,5), (1,10), (1,12), (1,13), (1,14), (1,15), (1,17), (1,18), (1,19), (1,24), (1,27), (1,30), (1,31), ... | {"n": 40, "k": 8, "edges": [[0, 1], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 16], [0, 18], [0, 19], [0, 23], [0, 27], [0, 28], [0, 29], [0, 30], [0, 34], [0, 37], [1, 2], [1, 4], [1, 5], [1, 10], [1, 12], [1, 13], [1, 14], [1, 15], [1, 17], [1, 18], [1, 19], [1, 24], [1, 27], [1, 30], [1... | null | null | null | {"clique": [6, 8, 22, 23, 30, 31, 33, 38]} | 1 |
construct-mc-max-clique-l2-s7 | construct | mc_max_clique | graph_clique | graph_theory | competition | 2 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 40 vertices numbered 0..39 and 422 edges:
(0,1), (0,4), (0,6), (0,7), (0,9), (0,11), (0,12), (0,13), (0,14), (0,17), (0,18), (0,20), (0,21), (0,22), (0,29), (0,30), (0,31), (0,35), (0,36), (0,37), (0,38), (0,39), (1,2), (1,3), (1,4), (1,7), (1,11), (1,12), (1,13), (1,15), (1,17), (1,18), (1,20), (1,21), (1... | {"n": 40, "k": 8, "edges": [[0, 1], [0, 4], [0, 6], [0, 7], [0, 9], [0, 11], [0, 12], [0, 13], [0, 14], [0, 17], [0, 18], [0, 20], [0, 21], [0, 22], [0, 29], [0, 30], [0, 31], [0, 35], [0, 36], [0, 37], [0, 38], [0, 39], [1, 2], [1, 3], [1, 4], [1, 7], [1, 11], [1, 12], [1, 13], [1, 15], [1, 17], [1, 18], [1, 20], [1, ... | null | null | null | {"clique": [0, 1, 11, 12, 13, 20, 30, 39]} | 1 |
construct-mc-max-clique-l2-s8 | construct | mc_max_clique | graph_clique | graph_theory | competition | 2 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 40 vertices numbered 0..39 and 387 edges:
(0,1), (0,5), (0,6), (0,7), (0,8), (0,10), (0,11), (0,15), (0,16), (0,18), (0,19), (0,22), (0,24), (0,25), (0,27), (0,31), (0,32), (0,33), (0,34), (0,36), (0,38), (1,2), (1,3), (1,5), (1,6), (1,8), (1,9), (1,10), (1,12), (1,13), (1,14), (1,15), (1,17), (1,18), (1,2... | {"n": 40, "k": 8, "edges": [[0, 1], [0, 5], [0, 6], [0, 7], [0, 8], [0, 10], [0, 11], [0, 15], [0, 16], [0, 18], [0, 19], [0, 22], [0, 24], [0, 25], [0, 27], [0, 31], [0, 32], [0, 33], [0, 34], [0, 36], [0, 38], [1, 2], [1, 3], [1, 5], [1, 6], [1, 8], [1, 9], [1, 10], [1, 12], [1, 13], [1, 14], [1, 15], [1, 17], [1, 18... | null | null | null | {"clique": [1, 10, 12, 13, 15, 18, 20, 30]} | 1 |
construct-mc-max-clique-l2-s9 | construct | mc_max_clique | graph_clique | graph_theory | competition | 2 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 40 vertices numbered 0..39 and 400 edges:
(0,1), (0,2), (0,3), (0,6), (0,8), (0,10), (0,13), (0,15), (0,16), (0,19), (0,20), (0,21), (0,24), (0,25), (0,26), (0,27), (0,29), (0,31), (0,33), (0,35), (0,36), (0,37), (0,38), (0,39), (1,2), (1,4), (1,6), (1,9), (1,10), (1,12), (1,13), (1,15), (1,16), (1,17), (1... | {"n": 40, "k": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 6], [0, 8], [0, 10], [0, 13], [0, 15], [0, 16], [0, 19], [0, 20], [0, 21], [0, 24], [0, 25], [0, 26], [0, 27], [0, 29], [0, 31], [0, 33], [0, 35], [0, 36], [0, 37], [0, 38], [0, 39], [1, 2], [1, 4], [1, 6], [1, 9], [1, 10], [1, 12], [1, 13], [1, 15], [1, 16], [1, ... | null | null | null | {"clique": [0, 6, 8, 19, 24, 27, 31, 36]} | 1 |
construct-mc-max-clique-l3-s0 | construct | mc_max_clique | graph_clique | graph_theory | competition | 3 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 48 vertices numbered 0..47 and 594 edges:
(0,3), (0,4), (0,8), (0,9), (0,11), (0,14), (0,15), (0,16), (0,19), (0,20), (0,21), (0,23), (0,24), (0,25), (0,26), (0,28), (0,29), (0,30), (0,31), (0,32), (0,36), (0,37), (0,41), (0,43), (1,3), (1,4), (1,5), (1,6), (1,7), (1,10), (1,11), (1,13), (1,18), (1,19), (1... | {"n": 48, "k": 7, "edges": [[0, 3], [0, 4], [0, 8], [0, 9], [0, 11], [0, 14], [0, 15], [0, 16], [0, 19], [0, 20], [0, 21], [0, 23], [0, 24], [0, 25], [0, 26], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 36], [0, 37], [0, 41], [0, 43], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 10], [1, 11], [1, 13], [1, 18], [1, ... | null | null | null | {"clique": [1, 3, 11, 37, 38, 44, 45]} | 1 |
construct-mc-max-clique-l3-s1 | construct | mc_max_clique | graph_clique | graph_theory | competition | 3 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 52 vertices numbered 0..51 and 541 edges:
(0,5), (0,8), (0,16), (0,22), (0,26), (0,27), (0,28), (0,30), (0,31), (0,34), (0,35), (0,36), (0,37), (0,38), (0,41), (0,43), (0,48), (0,49), (0,50), (0,51), (1,2), (1,3), (1,5), (1,7), (1,10), (1,13), (1,14), (1,16), (1,20), (1,22), (1,25), (1,27), (1,28), (1,31),... | {"n": 52, "k": 5, "edges": [[0, 5], [0, 8], [0, 16], [0, 22], [0, 26], [0, 27], [0, 28], [0, 30], [0, 31], [0, 34], [0, 35], [0, 36], [0, 37], [0, 38], [0, 41], [0, 43], [0, 48], [0, 49], [0, 50], [0, 51], [1, 2], [1, 3], [1, 5], [1, 7], [1, 10], [1, 13], [1, 14], [1, 16], [1, 20], [1, 22], [1, 25], [1, 27], [1, 28], [... | null | null | null | {"clique": [8, 12, 40, 46, 48]} | 1 |
construct-mc-max-clique-l3-s2 | construct | mc_max_clique | graph_clique | graph_theory | competition | 3 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 58 vertices numbered 0..57 and 694 edges:
(0,2), (0,3), (0,7), (0,12), (0,15), (0,17), (0,19), (0,21), (0,24), (0,26), (0,32), (0,33), (0,34), (0,36), (0,42), (0,44), (0,45), (0,48), (0,50), (0,53), (0,56), (0,57), (1,7), (1,8), (1,9), (1,11), (1,12), (1,14), (1,15), (1,16), (1,19), (1,20), (1,21), (1,23),... | {"n": 58, "k": 5, "edges": [[0, 2], [0, 3], [0, 7], [0, 12], [0, 15], [0, 17], [0, 19], [0, 21], [0, 24], [0, 26], [0, 32], [0, 33], [0, 34], [0, 36], [0, 42], [0, 44], [0, 45], [0, 48], [0, 50], [0, 53], [0, 56], [0, 57], [1, 7], [1, 8], [1, 9], [1, 11], [1, 12], [1, 14], [1, 15], [1, 16], [1, 19], [1, 20], [1, 21], [... | null | null | null | {"clique": [46, 48, 49, 53, 56]} | 1 |
construct-mc-max-clique-l3-s3 | construct | mc_max_clique | graph_clique | graph_theory | competition | 3 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 50 vertices numbered 0..49 and 720 edges:
(0,2), (0,4), (0,5), (0,7), (0,8), (0,9), (0,10), (0,12), (0,13), (0,14), (0,21), (0,22), (0,23), (0,24), (0,27), (0,30), (0,33), (0,35), (0,36), (0,40), (0,41), (0,42), (0,43), (0,45), (0,46), (0,47), (1,2), (1,3), (1,4), (1,5), (1,7), (1,9), (1,10), (1,12), (1,15... | {"n": 50, "k": 5, "edges": [[0, 2], [0, 4], [0, 5], [0, 7], [0, 8], [0, 9], [0, 10], [0, 12], [0, 13], [0, 14], [0, 21], [0, 22], [0, 23], [0, 24], [0, 27], [0, 30], [0, 33], [0, 35], [0, 36], [0, 40], [0, 41], [0, 42], [0, 43], [0, 45], [0, 46], [0, 47], [1, 2], [1, 3], [1, 4], [1, 5], [1, 7], [1, 9], [1, 10], [1, 12]... | null | null | null | {"clique": [42, 44, 45, 47, 48]} | 1 |
construct-mc-max-clique-l3-s4 | construct | mc_max_clique | graph_clique | graph_theory | competition | 3 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 56 vertices numbered 0..55 and 936 edges:
(0,1), (0,2), (0,3), (0,4), (0,5), (0,8), (0,11), (0,12), (0,15), (0,17), (0,18), (0,19), (0,20), (0,22), (0,23), (0,24), (0,25), (0,26), (0,30), (0,32), (0,34), (0,36), (0,38), (0,39), (0,40), (0,41), (0,43), (0,44), (0,45), (0,46), (0,47), (0,49), (0,52), (0,54),... | {"n": 56, "k": 5, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 8], [0, 11], [0, 12], [0, 15], [0, 17], [0, 18], [0, 19], [0, 20], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 30], [0, 32], [0, 34], [0, 36], [0, 38], [0, 39], [0, 40], [0, 41], [0, 43], [0, 44], [0, 45], [0, 46], [0, 47], [0, 49], [0, 52], [... | null | null | null | {"clique": [43, 44, 46, 48, 51]} | 1 |
construct-mc-max-clique-l3-s5 | construct | mc_max_clique | graph_clique | graph_theory | competition | 3 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 55 vertices numbered 0..54 and 853 edges:
(0,1), (0,3), (0,6), (0,7), (0,8), (0,10), (0,11), (0,12), (0,14), (0,15), (0,17), (0,18), (0,21), (0,22), (0,23), (0,26), (0,27), (0,30), (0,31), (0,32), (0,33), (0,34), (0,37), (0,38), (0,40), (0,41), (0,42), (0,43), (0,44), (0,45), (0,47), (0,48), (0,50), (0,51)... | {"n": 55, "k": 6, "edges": [[0, 1], [0, 3], [0, 6], [0, 7], [0, 8], [0, 10], [0, 11], [0, 12], [0, 14], [0, 15], [0, 17], [0, 18], [0, 21], [0, 22], [0, 23], [0, 26], [0, 27], [0, 30], [0, 31], [0, 32], [0, 33], [0, 34], [0, 37], [0, 38], [0, 40], [0, 41], [0, 42], [0, 43], [0, 44], [0, 45], [0, 47], [0, 48], [0, 50], ... | null | null | null | {"clique": [1, 4, 11, 34, 35, 46]} | 1 |
construct-mc-max-clique-l3-s6 | construct | mc_max_clique | graph_clique | graph_theory | competition | 3 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 46 vertices numbered 0..45 and 654 edges:
(0,6), (0,7), (0,9), (0,10), (0,12), (0,15), (0,16), (0,17), (0,18), (0,19), (0,21), (0,22), (0,23), (0,24), (0,25), (0,30), (0,32), (0,33), (0,36), (0,37), (0,39), (0,41), (0,42), (0,43), (0,44), (1,3), (1,4), (1,5), (1,7), (1,8), (1,9), (1,10), (1,12), (1,13), (1... | {"n": 46, "k": 7, "edges": [[0, 6], [0, 7], [0, 9], [0, 10], [0, 12], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 30], [0, 32], [0, 33], [0, 36], [0, 37], [0, 39], [0, 41], [0, 42], [0, 43], [0, 44], [1, 3], [1, 4], [1, 5], [1, 7], [1, 8], [1, 9], [1, 10], [1, 12], [1, ... | null | null | null | {"clique": [33, 34, 35, 38, 39, 41, 44]} | 1 |
construct-mc-max-clique-l4-s0 | construct | mc_max_clique | graph_clique | graph_theory | competition | 4 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 60 vertices numbered 0..59 and 724 edges:
(0,8), (0,9), (0,10), (0,14), (0,15), (0,16), (0,18), (0,20), (0,21), (0,26), (0,28), (0,31), (0,33), (0,34), (0,40), (0,41), (0,43), (0,44), (0,45), (0,46), (0,47), (0,50), (0,53), (0,55), (0,56), (1,3), (1,4), (1,5), (1,6), (1,9), (1,12), (1,14), (1,17), (1,18), ... | {"n": 60, "k": 7, "edges": [[0, 8], [0, 9], [0, 10], [0, 14], [0, 15], [0, 16], [0, 18], [0, 20], [0, 21], [0, 26], [0, 28], [0, 31], [0, 33], [0, 34], [0, 40], [0, 41], [0, 43], [0, 44], [0, 45], [0, 46], [0, 47], [0, 50], [0, 53], [0, 55], [0, 56], [1, 3], [1, 4], [1, 5], [1, 6], [1, 9], [1, 12], [1, 14], [1, 17], [1... | null | null | null | {"clique": [1, 3, 6, 27, 43, 53, 54]} | 1 |
construct-mc-max-clique-l4-s1 | construct | mc_max_clique | graph_clique | graph_theory | competition | 4 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 57 vertices numbered 0..56 and 1017 edges:
(0,1), (0,2), (0,3), (0,4), (0,5), (0,6), (0,7), (0,8), (0,9), (0,10), (0,13), (0,15), (0,17), (0,18), (0,19), (0,23), (0,26), (0,28), (0,29), (0,30), (0,32), (0,33), (0,34), (0,36), (0,38), (0,39), (0,41), (0,42), (0,43), (0,45), (0,46), (0,47), (0,48), (0,49), (... | {"n": 57, "k": 10, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 13], [0, 15], [0, 17], [0, 18], [0, 19], [0, 23], [0, 26], [0, 28], [0, 29], [0, 30], [0, 32], [0, 33], [0, 34], [0, 36], [0, 38], [0, 39], [0, 41], [0, 42], [0, 43], [0, 45], [0, 46], [0, 47], [0, 48], [0,... | null | null | null | {"clique": [10, 13, 14, 15, 20, 22, 28, 35, 37, 38]} | 1 |
construct-mc-max-clique-l4-s2 | construct | mc_max_clique | graph_clique | graph_theory | competition | 4 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 69 vertices numbered 0..68 and 1408 edges:
(0,2), (0,3), (0,4), (0,8), (0,9), (0,10), (0,12), (0,16), (0,17), (0,18), (0,20), (0,21), (0,22), (0,27), (0,29), (0,30), (0,31), (0,32), (0,33), (0,34), (0,36), (0,37), (0,38), (0,39), (0,42), (0,43), (0,46), (0,47), (0,49), (0,50), (0,53), (0,54), (0,56), (0,57... | {"n": 69, "k": 9, "edges": [[0, 2], [0, 3], [0, 4], [0, 8], [0, 9], [0, 10], [0, 12], [0, 16], [0, 17], [0, 18], [0, 20], [0, 21], [0, 22], [0, 27], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 34], [0, 36], [0, 37], [0, 38], [0, 39], [0, 42], [0, 43], [0, 46], [0, 47], [0, 49], [0, 50], [0, 53], [0, 54], [0, 56], ... | null | null | null | {"clique": [2, 5, 8, 21, 30, 46, 50, 56, 60]} | 1 |
construct-mc-max-clique-l4-s3 | construct | mc_max_clique | graph_clique | graph_theory | competition | 4 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 57 vertices numbered 0..56 and 726 edges:
(0,1), (0,2), (0,8), (0,9), (0,10), (0,17), (0,18), (0,19), (0,21), (0,22), (0,24), (0,25), (0,29), (0,33), (0,34), (0,36), (0,39), (0,41), (0,49), (0,52), (0,53), (0,55), (1,3), (1,5), (1,7), (1,8), (1,9), (1,13), (1,16), (1,21), (1,23), (1,25), (1,26), (1,28), (1... | {"n": 57, "k": 7, "edges": [[0, 1], [0, 2], [0, 8], [0, 9], [0, 10], [0, 17], [0, 18], [0, 19], [0, 21], [0, 22], [0, 24], [0, 25], [0, 29], [0, 33], [0, 34], [0, 36], [0, 39], [0, 41], [0, 49], [0, 52], [0, 53], [0, 55], [1, 3], [1, 5], [1, 7], [1, 8], [1, 9], [1, 13], [1, 16], [1, 21], [1, 23], [1, 25], [1, 26], [1, ... | null | null | null | {"clique": [3, 33, 43, 44, 45, 54, 56]} | 1 |
construct-mc-max-clique-l4-s4 | construct | mc_max_clique | graph_clique | graph_theory | competition | 4 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 65 vertices numbered 0..64 and 1102 edges:
(0,1), (0,2), (0,5), (0,7), (0,12), (0,13), (0,16), (0,19), (0,23), (0,24), (0,26), (0,28), (0,29), (0,30), (0,32), (0,33), (0,34), (0,36), (0,37), (0,39), (0,40), (0,42), (0,43), (0,44), (0,45), (0,47), (0,48), (0,49), (0,50), (0,53), (0,54), (0,55), (0,56), (0,5... | {"n": 65, "k": 7, "edges": [[0, 1], [0, 2], [0, 5], [0, 7], [0, 12], [0, 13], [0, 16], [0, 19], [0, 23], [0, 24], [0, 26], [0, 28], [0, 29], [0, 30], [0, 32], [0, 33], [0, 34], [0, 36], [0, 37], [0, 39], [0, 40], [0, 42], [0, 43], [0, 44], [0, 45], [0, 47], [0, 48], [0, 49], [0, 50], [0, 53], [0, 54], [0, 55], [0, 56],... | null | null | null | {"clique": [3, 11, 26, 43, 48, 53, 54]} | 1 |
construct-mc-max-clique-l4-s5 | construct | mc_max_clique | graph_clique | graph_theory | competition | 4 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 55 vertices numbered 0..54 and 683 edges:
(0,2), (0,6), (0,7), (0,8), (0,11), (0,21), (0,26), (0,28), (0,29), (0,30), (0,33), (0,35), (0,44), (0,45), (0,46), (0,48), (0,49), (0,50), (0,52), (0,53), (1,2), (1,3), (1,5), (1,8), (1,13), (1,14), (1,16), (1,17), (1,19), (1,20), (1,21), (1,23), (1,24), (1,25), (... | {"n": 55, "k": 7, "edges": [[0, 2], [0, 6], [0, 7], [0, 8], [0, 11], [0, 21], [0, 26], [0, 28], [0, 29], [0, 30], [0, 33], [0, 35], [0, 44], [0, 45], [0, 46], [0, 48], [0, 49], [0, 50], [0, 52], [0, 53], [1, 2], [1, 3], [1, 5], [1, 8], [1, 13], [1, 14], [1, 16], [1, 17], [1, 19], [1, 20], [1, 21], [1, 23], [1, 24], [1,... | null | null | null | {"clique": [1, 3, 17, 23, 34, 39, 46]} | 1 |
construct-mc-max-clique-l4-s6 | construct | mc_max_clique | graph_clique | graph_theory | competition | 4 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 46 vertices numbered 0..45 and 594 edges:
(0,1), (0,3), (0,5), (0,7), (0,8), (0,10), (0,11), (0,12), (0,14), (0,16), (0,18), (0,19), (0,21), (0,23), (0,25), (0,27), (0,30), (0,31), (0,32), (0,33), (0,34), (0,36), (0,37), (0,38), (0,40), (0,43), (0,45), (1,4), (1,6), (1,11), (1,12), (1,15), (1,16), (1,17), ... | {"n": 46, "k": 8, "edges": [[0, 1], [0, 3], [0, 5], [0, 7], [0, 8], [0, 10], [0, 11], [0, 12], [0, 14], [0, 16], [0, 18], [0, 19], [0, 21], [0, 23], [0, 25], [0, 27], [0, 30], [0, 31], [0, 32], [0, 33], [0, 34], [0, 36], [0, 37], [0, 38], [0, 40], [0, 43], [0, 45], [1, 4], [1, 6], [1, 11], [1, 12], [1, 15], [1, 16], [1... | null | null | null | {"clique": [7, 16, 17, 18, 27, 29, 40, 42]} | 1 |
construct-mc-max-clique-l4-s7 | construct | mc_max_clique | graph_clique | graph_theory | competition | 4 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 60 vertices numbered 0..59 and 882 edges:
(0,1), (0,2), (0,3), (0,4), (0,7), (0,8), (0,9), (0,10), (0,11), (0,13), (0,15), (0,16), (0,17), (0,19), (0,20), (0,21), (0,22), (0,24), (0,33), (0,34), (0,37), (0,41), (0,42), (0,43), (0,45), (0,46), (0,47), (0,49), (0,52), (0,53), (0,54), (0,55), (0,59), (1,2), (... | {"n": 60, "k": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 13], [0, 15], [0, 16], [0, 17], [0, 19], [0, 20], [0, 21], [0, 22], [0, 24], [0, 33], [0, 34], [0, 37], [0, 41], [0, 42], [0, 43], [0, 45], [0, 46], [0, 47], [0, 49], [0, 52], [0, 53], [0, 54], [0, 55], [0, 59], [1... | null | null | null | {"clique": [1, 2, 13, 18, 35, 38, 46, 50]} | 1 |
construct-mc-max-clique-l5-s0 | construct | mc_max_clique | graph_clique | graph_theory | competition | 5 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 90 vertices numbered 0..89 and 1988 edges:
(0,1), (0,2), (0,3), (0,6), (0,7), (0,8), (0,9), (0,10), (0,11), (0,12), (0,13), (0,18), (0,19), (0,20), (0,21), (0,22), (0,26), (0,27), (0,30), (0,31), (0,35), (0,36), (0,39), (0,40), (0,41), (0,42), (0,48), (0,51), (0,53), (0,56), (0,57), (0,58), (0,59), (0,60),... | {"n": 90, "k": 12, "edges": [[0, 1], [0, 2], [0, 3], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 26], [0, 27], [0, 30], [0, 31], [0, 35], [0, 36], [0, 39], [0, 40], [0, 41], [0, 42], [0, 48], [0, 51], [0, 53], [0, 56], [0, 57], [0, 58], [0, 59], [... | null | null | null | {"clique": [6, 11, 15, 19, 26, 32, 40, 49, 51, 53, 61, 88]} | 1 |
construct-mc-max-clique-l5-s1 | construct | mc_max_clique | graph_clique | graph_theory | competition | 5 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 90 vertices numbered 0..89 and 2027 edges:
(0,2), (0,3), (0,4), (0,8), (0,9), (0,10), (0,12), (0,14), (0,15), (0,21), (0,22), (0,25), (0,27), (0,28), (0,29), (0,31), (0,32), (0,36), (0,37), (0,40), (0,41), (0,43), (0,44), (0,46), (0,47), (0,49), (0,53), (0,55), (0,56), (0,58), (0,60), (0,65), (0,66), (0,68... | {"n": 90, "k": 12, "edges": [[0, 2], [0, 3], [0, 4], [0, 8], [0, 9], [0, 10], [0, 12], [0, 14], [0, 15], [0, 21], [0, 22], [0, 25], [0, 27], [0, 28], [0, 29], [0, 31], [0, 32], [0, 36], [0, 37], [0, 40], [0, 41], [0, 43], [0, 44], [0, 46], [0, 47], [0, 49], [0, 53], [0, 55], [0, 56], [0, 58], [0, 60], [0, 65], [0, 66],... | null | null | null | {"clique": [4, 5, 9, 13, 16, 34, 39, 41, 69, 83, 85, 86]} | 1 |
construct-mc-max-clique-l5-s2 | construct | mc_max_clique | graph_clique | graph_theory | competition | 5 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 90 vertices numbered 0..89 and 2060 edges:
(0,2), (0,3), (0,9), (0,10), (0,12), (0,13), (0,14), (0,15), (0,17), (0,20), (0,21), (0,22), (0,24), (0,25), (0,26), (0,27), (0,28), (0,29), (0,31), (0,32), (0,33), (0,35), (0,37), (0,39), (0,40), (0,42), (0,43), (0,44), (0,47), (0,48), (0,51), (0,52), (0,53), (0,... | {"n": 90, "k": 12, "edges": [[0, 2], [0, 3], [0, 9], [0, 10], [0, 12], [0, 13], [0, 14], [0, 15], [0, 17], [0, 20], [0, 21], [0, 22], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 31], [0, 32], [0, 33], [0, 35], [0, 37], [0, 39], [0, 40], [0, 42], [0, 43], [0, 44], [0, 47], [0, 48], [0, 51], [0, 52], [0, 53... | null | null | null | {"clique": [19, 22, 24, 32, 34, 37, 42, 48, 67, 79, 80, 82]} | 1 |
construct-mc-max-clique-l5-s3 | construct | mc_max_clique | graph_clique | graph_theory | competition | 5 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 90 vertices numbered 0..89 and 2080 edges:
(0,1), (0,2), (0,3), (0,4), (0,5), (0,6), (0,7), (0,8), (0,9), (0,12), (0,13), (0,17), (0,18), (0,19), (0,20), (0,21), (0,23), (0,26), (0,27), (0,28), (0,30), (0,31), (0,34), (0,35), (0,38), (0,41), (0,42), (0,43), (0,44), (0,45), (0,50), (0,54), (0,60), (0,61), (... | {"n": 90, "k": 12, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 12], [0, 13], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 23], [0, 26], [0, 27], [0, 28], [0, 30], [0, 31], [0, 34], [0, 35], [0, 38], [0, 41], [0, 42], [0, 43], [0, 44], [0, 45], [0, 50], [0, 54], [0, 60], [0,... | null | null | null | {"clique": [19, 21, 29, 33, 56, 62, 69, 75, 80, 86, 88, 89]} | 1 |
construct-mc-max-clique-l5-s4 | construct | mc_max_clique | graph_clique | graph_theory | competition | 5 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 90 vertices numbered 0..89 and 2030 edges:
(0,4), (0,7), (0,10), (0,12), (0,17), (0,19), (0,22), (0,25), (0,26), (0,31), (0,32), (0,36), (0,37), (0,38), (0,40), (0,43), (0,46), (0,50), (0,51), (0,54), (0,56), (0,57), (0,59), (0,61), (0,63), (0,64), (0,67), (0,70), (0,74), (0,79), (0,80), (0,82), (0,85), (0... | {"n": 90, "k": 12, "edges": [[0, 4], [0, 7], [0, 10], [0, 12], [0, 17], [0, 19], [0, 22], [0, 25], [0, 26], [0, 31], [0, 32], [0, 36], [0, 37], [0, 38], [0, 40], [0, 43], [0, 46], [0, 50], [0, 51], [0, 54], [0, 56], [0, 57], [0, 59], [0, 61], [0, 63], [0, 64], [0, 67], [0, 70], [0, 74], [0, 79], [0, 80], [0, 82], [0, 8... | null | null | null | {"clique": [8, 10, 13, 14, 16, 48, 54, 56, 63, 75, 80, 81]} | 1 |
construct-mc-max-clique-l5-s5 | construct | mc_max_clique | graph_clique | graph_theory | competition | 5 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 90 vertices numbered 0..89 and 2076 edges:
(0,5), (0,8), (0,12), (0,13), (0,14), (0,15), (0,17), (0,20), (0,24), (0,27), (0,29), (0,36), (0,41), (0,43), (0,44), (0,46), (0,49), (0,50), (0,51), (0,52), (0,53), (0,55), (0,56), (0,62), (0,63), (0,65), (0,68), (0,69), (0,70), (0,75), (0,76), (0,78), (0,80), (0... | {"n": 90, "k": 12, "edges": [[0, 5], [0, 8], [0, 12], [0, 13], [0, 14], [0, 15], [0, 17], [0, 20], [0, 24], [0, 27], [0, 29], [0, 36], [0, 41], [0, 43], [0, 44], [0, 46], [0, 49], [0, 50], [0, 51], [0, 52], [0, 53], [0, 55], [0, 56], [0, 62], [0, 63], [0, 65], [0, 68], [0, 69], [0, 70], [0, 75], [0, 76], [0, 78], [0, 8... | null | null | null | {"clique": [1, 5, 24, 28, 29, 33, 45, 47, 58, 66, 68, 88]} | 1 |
construct-mc-max-clique-l5-s6 | construct | mc_max_clique | graph_clique | graph_theory | competition | 5 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 90 vertices numbered 0..89 and 2077 edges:
(0,3), (0,4), (0,6), (0,7), (0,8), (0,9), (0,10), (0,13), (0,16), (0,20), (0,21), (0,23), (0,25), (0,29), (0,30), (0,33), (0,35), (0,38), (0,41), (0,43), (0,45), (0,47), (0,48), (0,51), (0,52), (0,54), (0,55), (0,56), (0,58), (0,61), (0,62), (0,69), (0,73), (0,74)... | {"n": 90, "k": 12, "edges": [[0, 3], [0, 4], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 13], [0, 16], [0, 20], [0, 21], [0, 23], [0, 25], [0, 29], [0, 30], [0, 33], [0, 35], [0, 38], [0, 41], [0, 43], [0, 45], [0, 47], [0, 48], [0, 51], [0, 52], [0, 54], [0, 55], [0, 56], [0, 58], [0, 61], [0, 62], [0, 69], [0, 73], ... | null | null | null | {"clique": [3, 7, 10, 41, 42, 52, 55, 61, 63, 65, 81, 82]} | 1 |
construct-mc-max-clique-l5-s7 | construct | mc_max_clique | graph_clique | graph_theory | competition | 5 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 90 vertices numbered 0..89 and 2021 edges:
(0,3), (0,9), (0,12), (0,13), (0,14), (0,15), (0,18), (0,19), (0,20), (0,24), (0,25), (0,27), (0,28), (0,29), (0,32), (0,33), (0,38), (0,43), (0,44), (0,45), (0,46), (0,47), (0,48), (0,49), (0,50), (0,51), (0,52), (0,53), (0,54), (0,55), (0,56), (0,57), (0,59), (0... | {"n": 90, "k": 12, "edges": [[0, 3], [0, 9], [0, 12], [0, 13], [0, 14], [0, 15], [0, 18], [0, 19], [0, 20], [0, 24], [0, 25], [0, 27], [0, 28], [0, 29], [0, 32], [0, 33], [0, 38], [0, 43], [0, 44], [0, 45], [0, 46], [0, 47], [0, 48], [0, 49], [0, 50], [0, 51], [0, 52], [0, 53], [0, 54], [0, 55], [0, 56], [0, 57], [0, 5... | null | null | null | {"clique": [8, 22, 26, 31, 38, 60, 62, 74, 78, 84, 85, 89]} | 1 |
construct-mc-max-clique-l5-s8 | construct | mc_max_clique | graph_clique | graph_theory | competition | 5 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 90 vertices numbered 0..89 and 2000 edges:
(0,4), (0,5), (0,10), (0,11), (0,13), (0,15), (0,17), (0,18), (0,19), (0,20), (0,22), (0,26), (0,27), (0,29), (0,32), (0,34), (0,36), (0,38), (0,40), (0,45), (0,47), (0,48), (0,49), (0,50), (0,54), (0,55), (0,64), (0,65), (0,67), (0,69), (0,71), (0,72), (0,73), (0... | {"n": 90, "k": 12, "edges": [[0, 4], [0, 5], [0, 10], [0, 11], [0, 13], [0, 15], [0, 17], [0, 18], [0, 19], [0, 20], [0, 22], [0, 26], [0, 27], [0, 29], [0, 32], [0, 34], [0, 36], [0, 38], [0, 40], [0, 45], [0, 47], [0, 48], [0, 49], [0, 50], [0, 54], [0, 55], [0, 64], [0, 65], [0, 67], [0, 69], [0, 71], [0, 72], [0, 7... | null | null | null | {"clique": [2, 14, 15, 19, 22, 27, 30, 41, 42, 44, 59, 66]} | 1 |
construct-mc-max-clique-l5-s9 | construct | mc_max_clique | graph_clique | graph_theory | competition | 5 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 90 vertices numbered 0..89 and 1958 edges:
(0,4), (0,9), (0,10), (0,12), (0,13), (0,16), (0,18), (0,19), (0,20), (0,21), (0,23), (0,25), (0,28), (0,29), (0,32), (0,33), (0,34), (0,35), (0,37), (0,44), (0,49), (0,50), (0,51), (0,54), (0,56), (0,57), (0,58), (0,59), (0,60), (0,61), (0,63), (0,66), (0,67), (0... | {"n": 90, "k": 12, "edges": [[0, 4], [0, 9], [0, 10], [0, 12], [0, 13], [0, 16], [0, 18], [0, 19], [0, 20], [0, 21], [0, 23], [0, 25], [0, 28], [0, 29], [0, 32], [0, 33], [0, 34], [0, 35], [0, 37], [0, 44], [0, 49], [0, 50], [0, 51], [0, 54], [0, 56], [0, 57], [0, 58], [0, 59], [0, 60], [0, 61], [0, 63], [0, 66], [0, 6... | null | null | null | {"clique": [1, 2, 8, 9, 25, 30, 36, 43, 50, 52, 59, 77]} | 1 |
construct-mc-max-clique-l6-s0 | construct | mc_max_clique | graph_clique | graph_theory | competition | 6 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 120 vertices numbered 0..119 and 3609 edges:
(0,3), (0,4), (0,9), (0,11), (0,12), (0,14), (0,22), (0,23), (0,27), (0,28), (0,29), (0,31), (0,34), (0,35), (0,36), (0,37), (0,39), (0,45), (0,46), (0,49), (0,50), (0,51), (0,52), (0,54), (0,55), (0,56), (0,57), (0,58), (0,59), (0,60), (0,63), (0,66), (0,70), (... | {"n": 120, "k": 13, "edges": [[0, 3], [0, 4], [0, 9], [0, 11], [0, 12], [0, 14], [0, 22], [0, 23], [0, 27], [0, 28], [0, 29], [0, 31], [0, 34], [0, 35], [0, 36], [0, 37], [0, 39], [0, 45], [0, 46], [0, 49], [0, 50], [0, 51], [0, 52], [0, 54], [0, 55], [0, 56], [0, 57], [0, 58], [0, 59], [0, 60], [0, 63], [0, 66], [0, 7... | null | null | null | {"clique": [4, 27, 39, 41, 49, 55, 58, 80, 89, 90, 105, 107, 113]} | 1 |
construct-mc-max-clique-l6-s1 | construct | mc_max_clique | graph_clique | graph_theory | competition | 6 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 120 vertices numbered 0..119 and 3588 edges:
(0,1), (0,2), (0,3), (0,4), (0,8), (0,9), (0,10), (0,14), (0,15), (0,16), (0,17), (0,18), (0,20), (0,21), (0,22), (0,24), (0,25), (0,26), (0,38), (0,41), (0,42), (0,44), (0,46), (0,48), (0,49), (0,50), (0,51), (0,53), (0,54), (0,57), (0,58), (0,59), (0,60), (0,6... | {"n": 120, "k": 13, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 8], [0, 9], [0, 10], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 20], [0, 21], [0, 22], [0, 24], [0, 25], [0, 26], [0, 38], [0, 41], [0, 42], [0, 44], [0, 46], [0, 48], [0, 49], [0, 50], [0, 51], [0, 53], [0, 54], [0, 57], [0, 58], [0, 59], [0, 60],... | null | null | null | {"clique": [7, 25, 26, 30, 35, 63, 72, 85, 96, 98, 108, 109, 119]} | 1 |
construct-mc-max-clique-l6-s2 | construct | mc_max_clique | graph_clique | graph_theory | competition | 6 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 120 vertices numbered 0..119 and 3572 edges:
(0,2), (0,3), (0,4), (0,7), (0,8), (0,11), (0,12), (0,15), (0,16), (0,20), (0,26), (0,29), (0,30), (0,34), (0,36), (0,37), (0,38), (0,39), (0,40), (0,41), (0,43), (0,45), (0,47), (0,49), (0,51), (0,52), (0,54), (0,57), (0,59), (0,61), (0,62), (0,65), (0,68), (0,... | {"n": 120, "k": 13, "edges": [[0, 2], [0, 3], [0, 4], [0, 7], [0, 8], [0, 11], [0, 12], [0, 15], [0, 16], [0, 20], [0, 26], [0, 29], [0, 30], [0, 34], [0, 36], [0, 37], [0, 38], [0, 39], [0, 40], [0, 41], [0, 43], [0, 45], [0, 47], [0, 49], [0, 51], [0, 52], [0, 54], [0, 57], [0, 59], [0, 61], [0, 62], [0, 65], [0, 68]... | null | null | null | {"clique": [29, 31, 47, 60, 66, 75, 76, 89, 100, 110, 114, 116, 118]} | 1 |
construct-mc-max-clique-l6-s3 | construct | mc_max_clique | graph_clique | graph_theory | competition | 6 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 120 vertices numbered 0..119 and 3617 edges:
(0,1), (0,3), (0,4), (0,5), (0,6), (0,7), (0,11), (0,12), (0,13), (0,15), (0,16), (0,17), (0,18), (0,19), (0,20), (0,21), (0,23), (0,26), (0,27), (0,28), (0,30), (0,32), (0,33), (0,34), (0,35), (0,36), (0,41), (0,44), (0,46), (0,47), (0,50), (0,51), (0,53), (0,5... | {"n": 120, "k": 13, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 11], [0, 12], [0, 13], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 23], [0, 26], [0, 27], [0, 28], [0, 30], [0, 32], [0, 33], [0, 34], [0, 35], [0, 36], [0, 41], [0, 44], [0, 46], [0, 47], [0, 50], [0, 51], [0, 53],... | null | null | null | {"clique": [3, 10, 18, 19, 21, 31, 47, 60, 70, 82, 98, 102, 112]} | 1 |
construct-mc-max-clique-l6-s4 | construct | mc_max_clique | graph_clique | graph_theory | competition | 6 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 120 vertices numbered 0..119 and 3674 edges:
(0,1), (0,2), (0,4), (0,5), (0,6), (0,8), (0,13), (0,19), (0,21), (0,23), (0,25), (0,26), (0,27), (0,29), (0,30), (0,34), (0,36), (0,38), (0,40), (0,41), (0,44), (0,49), (0,50), (0,51), (0,53), (0,54), (0,58), (0,60), (0,61), (0,62), (0,63), (0,65), (0,67), (0,6... | {"n": 120, "k": 13, "edges": [[0, 1], [0, 2], [0, 4], [0, 5], [0, 6], [0, 8], [0, 13], [0, 19], [0, 21], [0, 23], [0, 25], [0, 26], [0, 27], [0, 29], [0, 30], [0, 34], [0, 36], [0, 38], [0, 40], [0, 41], [0, 44], [0, 49], [0, 50], [0, 51], [0, 53], [0, 54], [0, 58], [0, 60], [0, 61], [0, 62], [0, 63], [0, 65], [0, 67],... | null | null | null | {"clique": [19, 29, 37, 43, 44, 52, 53, 57, 76, 80, 95, 98, 119]} | 1 |
construct-mc-max-clique-l6-s5 | construct | mc_max_clique | graph_clique | graph_theory | competition | 6 | MathConstraint/max_clique | CC-BY-4.0 | [
"np_search"
] | Graph G with 120 vertices numbered 0..119 and 3629 edges:
(0,3), (0,4), (0,7), (0,9), (0,10), (0,12), (0,15), (0,16), (0,18), (0,19), (0,21), (0,23), (0,24), (0,26), (0,27), (0,28), (0,29), (0,30), (0,31), (0,32), (0,33), (0,34), (0,36), (0,37), (0,38), (0,43), (0,44), (0,45), (0,46), (0,52), (0,56), (0,57), (0,58), (0... | {"n": 120, "k": 13, "edges": [[0, 3], [0, 4], [0, 7], [0, 9], [0, 10], [0, 12], [0, 15], [0, 16], [0, 18], [0, 19], [0, 21], [0, 23], [0, 24], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 34], [0, 36], [0, 37], [0, 38], [0, 43], [0, 44], [0, 45], [0, 46], [0, 52], [0, 56], [0, 57], [0, 58... | null | null | null | {"clique": [21, 26, 28, 49, 51, 60, 66, 86, 90, 94, 100, 109, 111]} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.