AFTD Auto-Formalizing Theoretical Domains

glove_number

def

The glove number $\mathrm{gl}(G)$ of a simple graph $G$ is the minimum number of gloves $k \in \mathbb{N}$ admitting a clean handshake sequence covering all edges of $G$, defined as the infimum of the set of such $k$.

Statement

noncomputable def glove_number {V : Type*} (G : SimpleGraph V) : ℕ
Defined in
scout/2610-17602-clean-handshake-sequences.md:222
Verified
18 Oct 2026
Axioms
none listed
Built on 1
  • has_clean_handshake_seqA simple graph $G$ has a clean handshake sequence with $k$ gloves if there exists a sequence of handshakes over glove type…
Used by 10

Read back from the Lean

Given a type V and a simple graph G on V, glove_number G is defined as the infimum (in ℕ, with sInf ∅ = 0) of the set of natural numbers k such that there exists a clean handshake sequence using k gloves covering all edges of G. Specifically, has_clean_handshake_seq G k asserts the existence of a finite list seq : List (Handshake V (Fin k)) such that: 1. seq is a valid clean handshake sequence starting from the empty contamination state fun _ => ∅. 2. For every edge e in G.edgeSet, there exists some handshake h in seq whose associated edge handshake_edge h equals e.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The glove number of a simple graph. -/
noncomputable def glove_number {V : Type*} (G : SimpleGraph V) : ℕ := sInf {k : ℕ | has_clean_handshake_seq G k}
See it in the graphDiscuss this resultChallenge it