The complete-join characterization of local antimagic chromatic number

About 8 years old · traced to

Let GG be a graph, let KnK_n be the complete graph on nn vertices, and let G∨KnG\vee K_n denote their join. Write χ(G)\chi(G) for the chromatic number and χla(G)\chi_{la}(G) for the local antimagic chromatic number.

Complete-join characterization. For n≥2n\ge 2,

χla(G∨Kn)≥χla(G)+n\chi_{la}(G\vee K_n)\ge\chi_{la}(G)+n

if and only if

χla(G)=χ(G).\chi_{la}(G)=\chi(G).

The conjecture proposes an exact criterion for the local antimagic chromatic number to increase by at least nn under joining with a complete graph. The supplied text states the claim but gives no resolution, so its status remains open.

References

Primary source

Gee-Choon Lau, Wai-Chee Shiu and Ho-Kuen Ng, “On local antimagic chromatic number of cycle-related join graphs”, arXiv:1805.04888 (2018).

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.