Rooted three-arm α-labelings and graceful six- and seven-arm spiders

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.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24315258
Primary Topic
Graph Labeling and Dimension Problems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Rooted three-arm α-labelings and graceful six- and seven-arm spiders

Keisuke Sato
1 links
Zenodo (CERN European Organization for Nuclear Research)
Graph Labeling and Dimension Problems
preprint

Rooted three-arm α-labelings and graceful six- and seven-arm spiders

Keisuke Sato
preprint en

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.

Zenodo (CERN European Organization for Nuclear Research)
Graph Labeling and Dimension Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon