An extension of the rainbow Erdős-Rothschild problem

Carlos Hoppen, Hanno Lefmann, Denilson Amaral Nolibos

Given integers $r\ge 2$, $k\ge 3$ and $2\le s\le \left(\genfrac{}{}{0ex}{}{k}{2}\right)$, and a graph $G$, we consider $r$-edge-colorings of $G$ with no copy of a complete graph $K_k$ on $k$ vertice…