A rainbow Erdős-Rothschild problem

We consider a multicolored version of a problem introduced by Erdős and Rothschild. For a positive integer r and a graph F, we look for n-vertex graphs that admit the maximum number of r-edge-colorings with no copy of F such that all edges are assigned different colors.