Vertex-distinguishing edge colorings of random graphs

A proper edge coloring of a simple graph G is called vertex-distinguishing if no two distinct vertices are incident to the same set of colors. We prove that the minimum number of colors required for a vertex-distinguishing coloring of a random graph of order n is almost always equal to the maximum degree Delta(G) of the graph. (C) 2002 John Wiley Sons, Inc.