AFTD Auto-Formalizing Theoretical Domains

simple_graph_upper_k_star_forming_number

def

SF_k(G): the maximum cardinality of a minimal k-star-forming vertex set of G.

Statement

noncomputable def simple_graph_upper_k_star_forming_number {V : Type*} (G : SimpleGraph V)
    (k : ℕ) : ℕ
Defined in
arXiv:2610.03785 (Upper k-star-forming sets, k-independence, and upper domination), Definition 2.1 (SF_k).
Verified
14 Oct 2026
Axioms
none listed
Built on 1
Used by 5

Lean source view module on GitHub

/-- `SF_k(G)`: the maximum cardinality of a minimal `k`-star-forming vertex set. -/
noncomputable def simple_graph_upper_k_star_forming_number {V : Type*} (G : SimpleGraph V)
    (k : ℕ) : ℕ :=
  sSup {n | ∃ S : Finset V, simple_graph_is_minimal_k_star_forming G k S ∧ S.card = n}
See it in the graphDiscuss this resultChallenge it