op_1239_candidate36
def
The simple graph on the 36 vertices Fin 36 with the 35 undirected edges listed in its definition.
Statement
def op_1239_candidate36 : SimpleGraph (Fin 36)- Source
- Candidate for OP-1239; computations 28328 and 28332 checks the standard leaf-deletion recurrence from arXiv:2611.07503, Lemma 1.
- Verified
- 15 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 5
- op_1239_candidate36_petrial_coefficientsThe partial Petrial coefficients of op_1239_candidate36 in ranks 27, 28, and 29 are respectively 256, 32640, and 4666944.
- op_1239_candidate36_not_log_concaveThe partial Petrial polynomial of op_1239_candidate36 is not log-concave.
- op_1239_candidate36_treeThe graph op_1239_candidate36 is a tree.
- op_1239_subcubic_tree_counterexampleThere exists a tree on Fin 36 with maximum degree at most three whose partial Petrial polynomial is not log-concave.
- op_1239_candidate36_max_degreeThe maximum degree of op_1239_candidate36 is at most 3.
Lean source view module on GitHub
/-- The explicit 36-vertex candidate for a maximum-degree-three tree with a non-log-concave partial Petrial polynomial. -/ def op_1239_candidate36 : SimpleGraph (Fin 36) := simple_graph_of_edge_list [(0, 1), (0, 3), (0, 8), (1, 2), (1, 4), (2, 6), (2, 7), (3, 5), (3, 21), (4, 12), (4, 16), (5, 13), (5, 14), (6, 9), (6, 18), (7, 10), (7, 15), (8, 11), (8, 26), (10, 19), (10, 30), (11, 27), (11, 33), (12, 22), (13, 17), (14, 24), (16, 20), (16, 31), (18, 29), (18, 32), (20, 23), (20, 28), (23, 25), (28, 34), (29, 35)]