op_1239_candidate31
def
The simple graph on Fin 31 whose edges are the thirty pairs listed in its definition.
Statement
def op_1239_candidate31 : SimpleGraph (Fin 31)- Source
- OP-1239, arXiv:2611.07503, Problem 16; candidate from experiments 28663 and 28669.
- Verified
- 16 Nov 2026
- Axioms
- none listed
- Built on 1
- simple_graph_of_edge_listThe simple graph on {0,…,n−1} whose edges are the unordered pairs occurring in the list L (a pair (a, b) in L contributes the edge {a, b},…
- Used by 4
- op_1239_candidate31_max_degreeThe maximum degree of op_1239_candidate31 is at most three.
- op_1239_candidate31_treeThe graph op_1239_candidate31 is a tree.
- op_1239_candidate31_coefficients_of_polyIf the nullity polynomial of op_1239_candidate31 is the displayed degree-seven polynomial, then its partial Petrial coefficients in ranks…
- op_1239_candidate31_nullity_poly_conditionalFor op_1239_candidate31, assuming the stated empty and one-vertex base cases and the stated finite-set cut and leaf identities, the…
Lean source view module on GitHub
def op_1239_candidate31 : SimpleGraph (Fin 31) := simple_graph_of_edge_list [(0, 1), (0, 11), (0, 21), (1, 2), (1, 4), (2, 3), (4, 5), (4, 6), (6, 7), (6, 9), (7, 8), (9, 10), (11, 12), (11, 14), (12, 13), (14, 15), (14, 16), (16, 17), (16, 19), (17, 18), (19, 20), (21, 22), (21, 24), (22, 23), (24, 25), (24, 26), (26, 27), (26, 29), (27, 28), (29, 30)]