ten_vertex_exchange_triangle
def
The three edges of a triangle on specified vertices.
Statement
def ten_vertex_exchange_triangle (a b c : Fin 10) : 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 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_packing_qThe selected good ten-triangle packing.
- 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_familyThe explicit list of 52 triangle edge sets for the ten-vertex witness.
- ten_vertex_exchange_packing_pThe selected ten-triangle packing in the local exchange trap.
Lean source view module on GitHub
open scoped Sym2 def ten_vertex_exchange_triangle (a b c : Fin 10) : Finset (Sym2 (Fin 10)) := {s(a,b),s(a,c),s(b,c)}