Anti-van der Waerden Numbers of Graph Products
Combinatorics
2018-05-09 v1
Abstract
In this paper, anti-van der Waerden numbers on Cartesian products of graphs are investigated and a conjecture made by Schulte, et al (see arXiv:1802.01509) is answered. In particular, the anti-van der Waerden number of the Cartesian product of two graphs has an upper bound of four. This result is then used to determine the anti-van der Waerden number for any Cartesian product of two paths.
Cite
@article{arxiv.1805.02715,
title = {Anti-van der Waerden Numbers of Graph Products},
author = {Hunter Rehm and Alex Schulte and Nathan Warnberg},
journal= {arXiv preprint arXiv:1805.02715},
year = {2018}
}
Comments
15 pages, 3 figures