Linear configurations containing 4-term arithmetic progressions are uncommon

Leo Versteegen

A linear configuration is said to be common in $G$ if every 2-coloring of $G$ yields at least the number of monochromatic instances of a randomly chosen coloring. Saad and Wolf ask…