Anti-van der Waerden Numbers of Graph Products
classification
🧮 math.CO
keywords
anti-vanwaerdencartesiangraphsnumbernumbersproductproducts
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.