2018/05/07 by Hunter Rehm, Rehm, Hunter, Alex Schulte +3
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory #math.CO
paper · pdf · doi:10.48550/arxiv.1805.02715
15 pages, 3 figures
arxiv created 2018/05/07 · openalex publication_date 2018/05/07 · arxiv updated 2018/05/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.