Edge-colorings avoiding patterns in a triangle

Carlos Hoppen, Hanno Lefmann, Dionatan Ricardo Schmidt

For positive integers $n$ and $r$, we consider $n$-vertex graphs with the maximum number of $r$-edge-colorings with no copy of a triangle where exactly two colors appear. We prove…