Maximum number of edge colorings avoiding rainbow copies of $K_4$

Hiêp Hà n, Carlos Hoppen, Nicolas Moro Müller +1

In this paper we show that for $r\ge 12$ and any sufficiently large $n$-vertex graph $G$ the number of $r$-edge-colorings of $G$ with no rainbow $K_4$ is at most $r^{ex(n,K_4)}$,…