Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints

Abstract We consider a canonical Ramsey type problem. An edge‐coloring of a graph is called m‐good if each color appears at most m times at each vertex. Fixing a graph G and a positive integer m , let f ( m , G ) denote the smallest n such that every m ‐good edge‐coloring of K n yields a properly ed... View More