Anti-van der Waerden Numbers of Graph Products of Cycles

preprint2022arXivOpen access

Abstract

A kk-term arithmetic progression (kk-AP) in a graph GG is a list of vertices such that each consecutive pair of vertices is the same distance apart. If cc is a coloring function of the vertices of GG and a kk-AP in GG has each vertex colored distinctly, then that kk-AP is a rainbow kk-AP. The anti-van der Waerden number of a graph GG with respect to kk is the least positive integer rr such that every surjective coloring with domain V(G)V(G) and codomain {1,2,…,r}=[r]\{1,2,\dots,r\} = [r] is guaranteed to have a rainbow kk-AP. This paper focuses on 33-APs and graph products with cycles. Specifically, the anti-van der Waerden number with respect to 33 is determined precisely for Pm□CnP_m \square C_n, Cm□CnC_m\square C_n and G□C2n+1G\square C_{2n+1}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.