| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651935 | Electronic Notes in Discrete Mathematics | 2015 | 8 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
