English

On the Lettericity of Paths

Combinatorics 2020-07-08 v1

Abstract

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

Keywords

Cite

@article{arxiv.2007.03636,
  title  = {On the Lettericity of Paths},
  author = {Robert Ferguson},
  journal= {arXiv preprint arXiv:2007.03636},
  year   = {2020}
}

Comments

4 pages, 4 figures