AFTD Auto-Formalizing Theoretical Domains

simple_graph_multi_radio_number

def

The (m,k)-radio number lambda_k^m(G): the least span of an (m,k)-radio labeling of G.

Statement

noncomputable def simple_graph_multi_radio_number {V : Type*} [Fintype V] (G : SimpleGraph V)
    (m k : ℕ) : ℕ
Defined in
arXiv:2610.25863 (On Multi-label radio Labelings of Graphs), Sec. 1 (radio number)
Verified
20 Oct 2026
Axioms
none listed
Built on 2
  • simple_graph_is_multi_radio_labelingAn (m,k)-radio labeling of G: each vertex gets a set of m nonnegative integer labels, and for any (possibly equal) vertices x, y and…
  • multi_label_spanThe span of a multi-labeling: the largest label used minus the smallest (written as the largest difference b - a over all pairs of labels).
Used by 6

Lean source view module on GitHub

/-- The (m,k)-radio number lambda_k^m(G): the least span of an (m,k)-radio labeling of G. -/
noncomputable def simple_graph_multi_radio_number {V : Type*} [Fintype V] (G : SimpleGraph V)
    (m k : ℕ) : ℕ :=
  sInf {s | ∃ f, simple_graph_is_multi_radio_labeling G m k f ∧ multi_label_span f = s}
See it in the graphDiscuss this resultChallenge it