Erickson–Klein conjecture on weakly cordial trees
Let be an Abelian group. A family of graphs is weakly -cordial if all but finitely many graphs in the family are -cordial. Erickson–Klein conjecture. For every Abelian group , the family of trees is weakly -cordial. The conjecture asks whether each Abelian group admits only finitely many exceptional trees; its general status is not specified in the source.
References
Primary source
Sylwia Cichacz, Barbara Krupińska and Mariusz Woźniak, “On rainbow caterpillars in elementary p-groups”, arXiv:2507.15083 (2025).
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.