The almost-all-trees conjecture for local antimagic chromatic number

About 6 years old · traced to

Let TT be a tree with kk pendant vertices. The families K(2;a,b)K(2;a,b) and Ct(3;a,0,b)Ct(3;a,0,b) are the exceptional tree families described in the supplied statement. Almost-all-trees conjecture. Almost all trees with kk pendant vertices have χla=k+1\chi_{la}=k+1; alternatively, all such trees have χla=k+1\chi_{la}=k+1 except K(2;a,b)K(2;a,b) with b≥a≥2b\ge a\ge2 and a<b(b+1)/2a<b(b+1)/2, and Ct(3;a,0,b)Ct(3;a,0,b) with a≤b<(a+2)(a−1)/3a\le b<(a+2)(a-1)/3 and a+b≡0,3(mod4)a+b\equiv0,3\pmod{4}. This is an informal and explicitly hedged formulation, with the proposed precise alternative left unresolved; it should be checked against the later formal tree conjecture.

References

Primary source

Gee-Choon Lau, Wai-Chee Shiu and Ho-Kuen Ng, “On number of pendants in local antimagic chromatic number”, arXiv:2001.05138 (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.