AFTD Auto-Formalizing Theoretical Domains

simple_graph_triangle_cover_number

def

τ(G): the minimum number of edges of G such that every triangle of G contains one of them.

Statement

noncomputable def simple_graph_triangle_cover_number {V : Type*} (G : SimpleGraph V) : ℕ
Defined in
arXiv:2610.15539 (Tuza's conjecture under an edge-count condition), Sec. 1 (τ(G), the triangle cover number).
Verified
14 Oct 2026
Axioms
none listed
Used by 24

Lean source view module on GitHub

/-- `τ(G)`: the minimum number of edges of `G` meeting every triangle of `G`. -/
noncomputable def simple_graph_triangle_cover_number {V : Type*} (G : SimpleGraph V) : ℕ :=
  sInf {n | ∃ F : Finset (Sym2 V), (∀ e ∈ F, e ∈ G.edgeSet) ∧
    (∀ t : Finset V, G.IsNClique 3 t → ∃ e ∈ F, ∀ x ∈ e, x ∈ t) ∧ F.card = n}
See it in the graphDiscuss this resultChallenge it