Even-arity complete full tree local antimagic chromatic number conjecture
Let be a complete full -ary tree, meaning a rooted tree in which every nonleaf has exactly children and all leaves have the same depth. Let be the number of leaves and let be the local antimagic chromatic number. Even-arity complete full tree conjecture. For every even integer ,
The paper explicitly states this conjecture as open; it would sharpen the established upper bound , while the equality is proved in the paper for odd .
References
- Martin Bača, Andrea Semaničová-Feňovčíková, Ruei-Ting Lai and Tao-Ming Wang, “On local antimagic vertex coloring for complete full t-ary trees”, arXiv:2204.04479 (2022).
Progress summary
The conjecture remains open: a reader-submitted proof claim exists, but no independent source has checked it.
Bača, Semaničová-Feňovčíková, Lai, and Wang posed the conjecture in their 2022 paper: every complete full tree of even arity should have local antimagic chromatic number one greater than its number of leaves.
Known results
- For every complete full -ary tree with leaves, .
- Equality is proved for odd .
- For even , the paper establishes only and leaves equality conjectural.
Community submission (unverified), November 7, 2026
A submitted proof argues that the equality holds for every even and every positive depth, using a proposed full-tree certificate and supporting constructions. This claim is unverified and has no independent mathematical assessment in the retrieved sources.
Current status (as of November 2026): The bounds and the odd- case are established, while the even- equality remains open because the November 2026 proof submission is unverified.
Sources
Solutions 1
Symmetric-shell labellings of complete full trees with even branching: proof of the even case of the Bača-Semaničová-Feňovčíková-Lai-Wang local antimagic conjecture (Fundamenta Informaticae 185 (2022), Conjecture 6.1)See full solution
Result and scope. Bača, Semaničová-Feňovčíková, Lai and Wang, Conjecture 6.1, even case: for every complete full t-ary tree T with t ≥ 2 even, χ_la(T) = l + 1. Proved for every even t ≥ 2 and depth n ≥ 1, for every finite graph carrying the full-tree certificate.
Complete proof: Symmetric-shell labellings of complete full trees with even branching: proof of the even case of the Bača-Semaničová-Feňovčíková-Lai-Wang local antimagic conjecture (Fundamenta Informaticae 185 (2022), Conjecture 6.1) · PDF.
The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.
This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.