AFTD Auto-Formalizing Theoretical Domains

simple_graph_triangle_packing_number

def

ν(G): the maximum number of pairwise edge-disjoint triangles of G (two triangles are edge-disjoint when they share at most one vertex).

Statement

noncomputable def simple_graph_triangle_packing_number {V : Type*} [DecidableEq V]
    (G : SimpleGraph V) : ℕ
Defined in
arXiv:2610.15539 (Tuza's conjecture under an edge-count condition), Sec. 1 (ν(G), the triangle packing number).
Verified
14 Oct 2026
Axioms
none listed
Used by 63

Lean source view module on GitHub

/-- `ν(G)`: the maximum number of pairwise edge-disjoint triangles of `G`. -/
noncomputable def simple_graph_triangle_packing_number {V : Type*} [DecidableEq V]
    (G : SimpleGraph V) : ℕ :=
  sSup {n | ∃ T : Finset (Finset V), (∀ t ∈ T, G.IsNClique 3 t) ∧
    (T : Set (Finset V)).Pairwise (fun s t => (s ∩ t).card ≤ 1) ∧ T.card = n}
See it in the graphDiscuss this resultChallenge it