Odd-path local antimagic total chromatic number conjecture

Let PnP_n be the path of order n2n\geq 2, and let χlat(Pn)\chi_{lat}(P_n) denote its local antimagic total chromatic number. Odd-path conjecture. For odd n3n\geq 3,

χlat(Pn)=2.\chi_{lat}(P_n)=2.

The source verifies the assertion explicitly for n=3,5,7n=3,5,7 and states it for all odd n3n\geq 3; no general proof or resolution is supplied in the provided text.

Sources & referencesView supporting material

Primary source

Gee-Choon Lau, “Every Graph Is Local Antimagic Total And Its Applications To Local Antimagic (Total) Chromatic Numbers”, arXiv:1906.10332 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.