op223_example_graph
def
The eight-vertex tree with edges 01, 04, 07, 12, 23, 45 and 46.
Statement
def op223_example_graph : SimpleGraph (Fin 8)- Source
- arXiv:2610.17078 Open Problem 6.1; exact experiment 22883
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Used by 6
- op223_example_spectral_upperThe spectral radius of the eight-vertex example tree is at most 209/100.
- op223_first_replacement_spectral_lowerReplacing edge 0-1 with 4-2 in the example tree yields a graph whose spectral radius is greater than 209/100.
- op223_example_slideReplace edge 4-b by 5-b in the eight-vertex example.
- op223_conditional_slide_refutationIf the example graph is sustainable and its two possible slides at the edge 4-5 are nonsustainable, then the universal leaf-slide…
- op223_example_graph_edge_01_sustainableEdge 0-1 in op223_example_graph is sustainable.
- op223_example_graph_is_treeThe eight-vertex example graph op223_example_graph is a tree.
Lean source view module on GitHub
def op223_example_graph : SimpleGraph (Fin 8) :=
SimpleGraph.fromEdgeSet {s(0,1), s(0,4), s(0,7), s(1,2), s(2,3), s(4,5), s(4,6)}