AFTD Auto-Formalizing Theoretical Domains

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
Used by 1

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⟩
See it in the graphDiscuss this resultChallenge it