Even-arity complete full tree local antimagic chromatic number conjecture
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 .
Sources & referencesView supporting material
Primary source
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.