• Maximum number of r-edge-colorings such that all copies of Kk are rainbow 

      Bastos, Antônio Josefran de Oliveira; Lefmann, Hanno; Oertel, Andy; Hoppen, Carlos; Schmidt, Dionatan Ricardo (2021) [Artigo de periódico]
      We consider a version of the Erdős-Rothschild problem for families of graph patterns. For any fixed k ≥ 3, let r0(k) be the largest integer such that the following holds for all 2 ≤ r ≤ r0(k) and all sufficiently large n: ...