LOCAL EDGE COLORINGS THAT ARE GLOBAL

A local (H, k)-coloring of K(n) is a coloring of its edges in which ea ch of its subgraphs isomorphic to H is colored by at most k colors. A necessary condition on H (conjectured to be sufficient) is found such that each local (H, k)-coloring is a k-coloring. Furthermore, necessar y and sufficient conditions are given for each local (H, k)-coloring t o be a coloring by a bounded number of colors. (C) 1994 John Wiley & S ons, Inc.