ten_vertex_exchange_edges
def
The 35 unordered edges of the explicit ten-vertex witness.
Statement
def ten_vertex_exchange_edges : Finset (Sym2 (Fin 10))- Source
- Explicit ten-vertex witness for simple_graph_stable_point_irreducible_forced_exchange_barrier_counterexample.
- Verified
- 10 Nov 2026
- Axioms
- none listed
- Used by 9
- 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_graphThe simple graph built from the explicit ten-vertex edge set.
- 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_finite_witness_factsThe explicit edge and triangle lists have sizes 35 and 52; the displayed P and Q are edge-disjoint ten-triangle packings in the list, and…
- 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
open scoped Sym2 def ten_vertex_exchange_edges : Finset (Sym2 (Fin 10)) := {s(0,1), s(0,2), s(0,3), s(0,6), s(0,7), s(0,8), s(0,9), s(1,2), s(1,3), s(1,4), s(1,5), s(1,7), s(2,3), s(2,4), s(2,5), s(2,7), s(2,8), s(2,9), s(3,4), s(3,5), s(3,6), s(3,7), s(3,9), s(4,5), s(4,6), s(4,7), s(4,8), s(5,6), s(5,8), s(5,9), s(6,7), s(6,8), s(6,9), s(7,8), s(8,9)}