This allows for the definition of the anti-van derWaerden number of a graph, which is the least positive integer r such that every exact r-coloring of a graph contains a rainbow k-term arithmetic ...