A framework for the generalised Erdős-Rothschild problem and a resolution of the dichromatic triangle case

Pranshu Gupta, Yani Pehova, Emil Powierski +1

The Erdős-Rothschild problem from 1974 asks for the maximum number of $s$-edge colourings in an $n$-vertex graph which avoid a monochromatic copy of $K_k$, given positive integers…