AFTD Auto-Formalizing Theoretical Domains

simple_graph_triangle_cover_packing_gap_witness_graph_decidable

instance

Adjacency in the witness graph is decidable, so the finite computations can be run by decide.

Statement

instance simple_graph_triangle_cover_packing_gap_witness_graph_decidable : DecidableRel simple_graph_triangle_cover_packing_gap_witness_graph.Adj
Source
step towards simple_graph_minimum_triangle_cover_outside_maximum_packing_support
Verified
08 Nov 2026
Axioms
none listed
Built on 2

Lean source view module on GitHub

/-- Decidable adjacency for the witness graph. -/
instance simple_graph_triangle_cover_packing_gap_witness_graph_decidable : DecidableRel simple_graph_triangle_cover_packing_gap_witness_graph.Adj := fun a b => by
  show Decidable (a ≠ b ∧ Sym2.mk a b ∉ simple_graph_triangle_cover_packing_gap_deleted_edges)
  infer_instance
See it in the graphDiscuss this resultChallenge it