simple_graph_stable_point_irreducible_forced_local_minimum_counterexample_graph
def
The nine-vertex witness graph with the 26 listed edges.
Statement
def simple_graph_stable_point_irreducible_forced_local_minimum_counterexample_graph : SimpleGraph (Fin 9)- Source
- step towards simple_graph_stable_point_irreducible_forced_local_minimum_counterexample
- Verified
- 10 Nov 2026
- Axioms
- none listed
- Built on 1
- simple_graph_stable_point_irreducible_forced_local_minimum_counterexample_edgesThe 26 edges of the nine-vertex witness graph, listed explicitly as unordered vertex pairs.
- Used by 1
- simple_graph_stable_point_irreducible_forced_local_minimum_counterexample_graph_decidable_relAdjacency in the witness graph is decidable, through membership in the explicit edge list.
Lean source view module on GitHub
/-- The nine-vertex witness graph, built from the explicit 26-edge set. -/ def simple_graph_stable_point_irreducible_forced_local_minimum_counterexample_graph : SimpleGraph (Fin 9) := SimpleGraph.fromEdgeSet (↑simple_graph_stable_point_irreducible_forced_local_minimum_counterexample_edges)