Kaplan–Lev–Roditty's antimagic conjecture for trees

About 2 years old · traced to

Let AA be a finite Abelian group, and write I(A)I(A) for the set of involutions of AA. Set A∗=A∖{0}A^*=A\setminus\{0\}. An A∗A^*-antimagic labeling of a graph with ∣A∣|A| vertices is a bijection from its edges to A∗A^* such that all vertex sums are pairwise distinct. Kaplan–Lev–Roditty's antimagic conjecture. A tree with ∣A∣|A| vertices is A∗A^*-antimagic if and only if ∣I(A)∣≠1|I(A)|\neq1. The supplied source reports that this conjecture was proved for 44-trees, but does not establish the full conjecture; the general assertion is therefore not resolved by the stated evidence.

References

Primary source

Sylwia Cichacz, “E_A-cordial labeling of graphs and its implications for A-antimagic labeling of trees”, arXiv:2409.09136 (2024).

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.