Full classification of anti-van der Waerden numbers of graph products of forests

Zhanar Berikkyzy, Joe Miller, Nathan Warnberg

The anti-van der Waerden number of a graph $G$ is the fewest number of colors needed to guarantee a rainbow $3$-term arithmetic progression in $G$, denoted $\mathrm{aw}(G,3)$…