English

Note on the thickness of the Cartesian product of a complete graph and a path

Combinatorics 2026-03-31 v1

Abstract

We determine the thickness of the Cartesian product K6p+4P2K_{6p+4} \square P_2 for p0p \ge 0 and of the Cartesian product K8PmK_8 \square P_m for m1m \ge 1, where KnK_n and PmP_m denote the complete graph on nn vertices and the path on mm vertices, respectively.

Keywords

Cite

@article{arxiv.2603.27968,
  title  = {Note on the thickness of the Cartesian product of a complete graph and a path},
  author = {Kenta Noguchi},
  journal= {arXiv preprint arXiv:2603.27968},
  year   = {2026}
}

Comments

6 pages, 2 figures