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
- simple_graph_multi_radio_number_path_three_of_le_of_forallReduction of the thread goal to one finite statement per m: if no (m,3)-radio labeling of P_{4m+4} has all labels at most 8m - 2, then the…
- simple_graph_multi_radio_number_path_three_one_of_leFor every n >= 8 the (1,3)-radio number of the path P_n is exactly 7: the case m = 1 of the thread's goal (8m - 1 for n >= 4m + 4).
- simple_graph_multi_radio_number_path_three_ltThe threshold 4m + 4 is sharp: the (m,3)-radio number of P_{4m+3} is less than 8m - 1.
- simple_graph_multi_radio_number_topFor n >= 2, k >= 1 and m >= 1, the (m,k)-radio number of the complete graph K_n is k(mn - 1).
- simple_graph_multi_radio_number_path_le_eight_mulFor n, m >= 1 the (m,3)-radio number of the path P_n is at most 8m - 1.
- simple_graph_multi_radio_number_path_monoThe (m,k)-radio number of the path P_n is nondecreasing in n: a labeling of P_{n+1} restricts to one of P_n.
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}