On rainbow caterpillars in elementary $p$-groups
Combinatorics
2025-07-22 v1
Abstract
Given a finite Abelian group , consider a tree with vertices. The labeling of the vertices of some graph induces an edge labeling in , thus the edge receives the label . The tree is -rainbow colored if is a bijection and edges have different colors. In this paper, we give necessary and sufficient conditions for a caterpillar with three spine vertices to be -rainbow, when is an elementary -group.
Cite
@article{arxiv.2507.15083,
title = {On rainbow caterpillars in elementary $p$-groups},
author = {Sylwia Cichacz and Barbara Krupińska and Mariusz Woźniak},
journal= {arXiv preprint arXiv:2507.15083},
year = {2025}
}