Kaplan–Lev–Roditty's antimagic conjecture for trees
Kaplan–Lev–Roditty's antimagic conjecture for trees
Let be a finite Abelian group, and write for the set of involutions of . Set . An -antimagic labeling of a graph with vertices is a bijection from its edges to such that all vertex sums are pairwise distinct. Kaplan–Lev–Roditty's antimagic conjecture. A tree with vertices is -antimagic if and only if . The supplied source reports that this conjecture was proved for -trees, but does not establish the full conjecture; the general assertion is therefore not resolved by the stated evidence.
Sources & referencesView supporting material
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
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.