op_1239_candidate31_max_degree
theoremverified
The maximum degree of op_1239_candidate31 is at most three.
Statement
theorem op_1239_candidate31_max_degree : letI : DecidableRel op_1239_candidate31.Adj := Classical.decRel _; op_1239_candidate31.maxDegree ≤ 3- Source
- OP-1239, arXiv:2611.07503, Problem 16; candidate from experiments 28663 and 28669.
- Verified
- 16 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- op_1239_candidate31The simple graph on Fin 31 whose edges are the thirty pairs listed in its definition.
- simple_graph_of_edge_list_decidable_relAdjacency in the graph determined by an edge list is decidable.
- op_1239_candidate31_treeThe graph op_1239_candidate31 is a tree.
Lean source view module on GitHub
theorem op_1239_candidate31_max_degree : letI : DecidableRel op_1239_candidate31.Adj := Classical.decRel _; op_1239_candidate31.maxDegree ≤ 3 := by have h : Classical.decRel op_1239_candidate31.Adj = (Op1239Graph31.adjacency : DecidableRel op_1239_candidate31.Adj) := Subsingleton.elim _ _ rw [h] exact Op1239Graph31.graph_degree