ten_vertex_exchange_packing_q
def
The selected good ten-triangle packing.
Statement
def ten_vertex_exchange_packing_q : Finset (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
- Built on 1
- ten_vertex_exchange_triangleThe three edges of a triangle on specified vertices.
- Used by 4
- 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_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_edge_setThe witness graph has exactly the 35 listed edges.
Lean source view module on GitHub
def ten_vertex_exchange_packing_q : Finset (Finset (Sym2 (Fin 10))) := {ten_vertex_exchange_triangle 0 1 2, ten_vertex_exchange_triangle 2 7 8, ten_vertex_exchange_triangle 3 4 7, ten_vertex_exchange_triangle 0 3 6, ten_vertex_exchange_triangle 4 6 8, ten_vertex_exchange_triangle 0 8 9, ten_vertex_exchange_triangle 5 6 9, ten_vertex_exchange_triangle 1 3 5, ten_vertex_exchange_triangle 2 3 9, ten_vertex_exchange_triangle 2 4 5}