English

On rainbow caterpillars in elementary $p$-groups

Combinatorics 2025-07-22 v1

Abstract

Given a finite Abelian group (A,+)(A,+), consider a tree TT with A|A| vertices. The labeling f ⁣:V(T)Af \colon V (T) \rightarrow A of the vertices of some graph GG induces an edge labeling in GG, thus the edge uvuv receives the label f(u)+f(v)f (u) + f (v). The tree TT is AA-rainbow colored if ff 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 AA-rainbow, when AA is an elementary pp-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}
}
R2 v1 2026-07-01T04:10:11.220Z