simple_graph_triangle_cover_packing_gap_deleted_edges
def
The four edges deleted from K7 to build the witness graph: {0,1}, {1,2}, {1,3}, {3,4}.
Statement
def simple_graph_triangle_cover_packing_gap_deleted_edges : Finset (Sym2 (Fin 7))- Source
- step towards simple_graph_minimum_triangle_cover_outside_maximum_packing_support
- Verified
- 08 Nov 2026
- Axioms
- none listed
- Used by 2
- simple_graph_triangle_cover_packing_gap_witness_graphThe seven-vertex witness graph: K7 with the edges {0,1}, {1,2}, {1,3}, {3,4} deleted (17 edges, 19 triangles).
- simple_graph_triangle_cover_packing_gap_witness_graph_decidableAdjacency in the witness graph is decidable, so the finite computations can be run by
decide.
Lean source view module on GitHub
/-- The four edges removed from K7 in the witness graph. -/ def simple_graph_triangle_cover_packing_gap_deleted_edges : Finset (Sym2 (Fin 7)) := {Sym2.mk 0 1, Sym2.mk 1 2, Sym2.mk 1 3, Sym2.mk 3 4}