Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles
Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles
It is well known that if the edges of a finite simple connected graph on n vertices are colored so that no cycle is rainbow, then no more than n-1 colors can appear on the edges. In previous work it has been shown that the essentially different rainbow-cycle-forbidding edge colorings …