Rooted three-arm α-labelings and graceful six- and seven-arm spiders
Year: 2026
Type: preprint
Abstract: We construct a hub-zero α-labeling of the three-arm spider S(a,b,c) whenever 1 ≤ a ≤ b ≤ c and c ≥ 7. This rooted supply theorem, combined with interval insertion at the hub, yields graceful labelings of every spider with six or seven positive arm lengths. The unbounded three-arm region is covered by fourteen grid-based seed families and endpoint-controlled path extensions. The six-arm proof reduces a splitting question to 924 capped length profiles. The seven-arm proof combines explicit offset-core formulas, 164 finite cores, a 3,432-profile base selector, and an exhaustive arithmetic partition of the unbounded region. We present the mathematical constructions together with their Lean 4 formalization. Finite labeling certificates are verified as actual vertex and edge-difference bijections; their generators are not trusted. The formalization proves the three universal existence statements with only the standard axioms reported by Lean's dependency audit.
Author: Sato, Keisuke
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7234959211
