simple_graph_triangle_cover_packing_gap_witness_graph
def
The seven-vertex witness graph: K7 with the edges {0,1}, {1,2}, {1,3}, {3,4} deleted (17 edges, 19 triangles).
Statement
def simple_graph_triangle_cover_packing_gap_witness_graph : SimpleGraph (Fin 7)- Source
- step towards simple_graph_minimum_triangle_cover_outside_maximum_packing_support
- Verified
- 08 Nov 2026
- Axioms
- none listed
- Built on 1
- simple_graph_triangle_cover_packing_gap_deleted_edgesThe four edges deleted from K7 to build the witness graph: {0,1}, {1,2}, {1,3}, {3,4}.
- Used by 1
- simple_graph_triangle_cover_packing_gap_witness_graph_decidableAdjacency in the witness graph is decidable, so the finite computations can be run by
decide.
- simple_graph_triangle_cover_packing_gap_witness_graph_decidableAdjacency in the witness graph is decidable, so the finite computations can be run by
Lean source view module on GitHub
/-- Witness graph for the minimum-cover-outside-maximum-packing-support counterexample. -/ def simple_graph_triangle_cover_packing_gap_witness_graph : SimpleGraph (Fin 7) where Adj a b := a ≠ b ∧ Sym2.mk a b ∉ simple_graph_triangle_cover_packing_gap_deleted_edges symm := ⟨fun a b h => ⟨h.1.symm, by rw [Sym2.eq_swap]; exact h.2⟩⟩ loopless := ⟨fun a h => h.1 rfl⟩