Find in Library

It is well known that if the edges of a finite simple connected graph on <em>n</em> vertices are colored so that no cycle is rainbow, then no more than <em>n-1</em> colors can appear on the edges. In previous work it has been shown that the essentially different rainbow-cycle-forbidding edge colorings of <em>K_n</em> with <em>n-1 </em>colors appearing are in 1-1 correspondence with (can be encoded by) the (isomorphism classes of) full binary trees with <em>n</em> leafs. In the encoding, the natural Huffman labeling of each tree arising from the assignment of 1 to each leaf plays a role. Very recently it has been shown that a similar encoding holds for rainbow-cycle-forbidding edge colorings of <em>K_a,b</em> with <em>a+b-1</em> colors appearing. In this case the binary trees are given Huffman labelings arising from certain assignments of (0,1) or (1,0) to the leafs. (Sibling leafs are not allowed to be assigned the same label.) In this paper we prove the analogous result for complete <em>r</em>-partite graphs, for <em>r</em> > 2.