Colorings with only rainbow arithmetic progressions (Q2220973)

In the paper it is proven that there exist \(\alpha, \beta < 1\) such that for every sufficiently large natural number \(n\), there is a set \(A\subset \{1,\dots,n\}\) with \(\vert A\vert \geq n- n^\alpha\) and a coloring of \(A\) with at most \(n^\beta\) colors, where every 3-term arithmetic progression in \(A\) is rainbow (i.e., their elements receive 3 distinct colors). This result is used to construct graphs with \(n\) vertices and \((1-o(1))\binom{n}{2}\) edges which can be partitioned into a small number of induced matchings. The first such constructions were found in \textit{N. Alon} et al. [J. Eur. Math. Soc. (JEMS) 15, No. 5, 1575--1596 (2013; Zbl 1278.05183)] as a corollary, a simple proof of main result the above paper is given.