On the Lettericity of Paths

Abstract

Verifying a conjecture of Petkov{š}ec, we prove that the lettericity of an n-vertex path is precisely $\lfloor \frac{n+4}{3}\rfloor$.

arXiv comment4 pages, 4 figures