ten_vertex_exchange_graph
def
The simple graph built from the explicit ten-vertex edge set.
Statement
def ten_vertex_exchange_graph : SimpleGraph (Fin 10)- Source
- Explicit ten-vertex witness for simple_graph_stable_point_irreducible_forced_exchange_barrier_counterexample.
- Verified
- 10 Nov 2026
- Axioms
- none listed
- Built on 1
- ten_vertex_exchange_edgesThe 35 unordered edges of the explicit ten-vertex witness.
- Used by 7
- ten_vertex_exchange_packing_upperThe witness has no packing of eleven edge-disjoint triangles.
- ten_vertex_exchange_edge_avoidableFor each of the 35 edges, a ten-triangle packing avoids that edge.
- ten_vertex_exchange_family_eqThe 52 explicit triangle edge sets are exactly the triangle family of the ten-vertex graph.
- ten_vertex_exchange_six_connectedDeleting any at most five vertices leaves the ten-vertex witness graph connected.
- ten_vertex_exchange_triangle_connectedAfter excluding each graph edge, the triangle family is connected under sharing any other edge.
- ten_vertex_exchange_codegreeEach edge of the witness lies in at least three triangles.
- ten_vertex_exchange_edge_setThe witness graph has exactly the 35 listed edges.
Lean source view module on GitHub
def ten_vertex_exchange_graph : SimpleGraph (Fin 10) := SimpleGraph.fromEdgeSet (↑ten_vertex_exchange_edges : Set (Sym2 (Fin 10)))