AFTD Auto-Formalizing Theoretical Domains

simple_graph_is_minimal_k_star_forming

def

A minimal k-star-forming set: a k-star-forming set no proper subset of which is k-star-forming.

Statement

def simple_graph_is_minimal_k_star_forming {V : Type*} (G : SimpleGraph V) (k : ℕ)
    (S : Finset V) : Prop
Defined in
arXiv:2610.03785 (Upper k-star-forming sets, k-independence, and upper domination), Definition 2.1 (minimality).
Verified
14 Oct 2026
Axioms
none listed
Built on 1
  • simple_graph_is_k_star_formingA vertex set S is k-star-forming when, for every vertex v outside S, the induced graph G[S ∪ {v}] contains a copy of the star K_{1,k} that…
Used by 6

Lean source view module on GitHub

/-- A minimal `k`-star-forming set: `k`-star-forming, and no proper subset is. -/
def simple_graph_is_minimal_k_star_forming {V : Type*} (G : SimpleGraph V) (k : ℕ)
    (S : Finset V) : Prop :=
  simple_graph_is_k_star_forming G k S ∧ ∀ T ⊂ S, ¬ simple_graph_is_k_star_forming G k T
See it in the graphDiscuss this resultChallenge it