On the pseudoachromatic index of the complete graph
Let q = 2? be, for some ???, and let n = q2 + q+ 1. By exhibiting a complete coloring of the edges of Kn, we show that the pseudoachromatic number ?(Gn) of the complete line graph Gn = L(Kn)or the pseudoachromatic index of Kn, if you willis at least q3 + q. This bound improves the implicit bound of Jamison [Discrete Math 74 (1989), 99115] which is given in terms of the achromatic number: ?(Gn)??(Gn)?q3 + 1. We also calculate, precisely, the pseudoachromatic number when q+ 1 extra points are added:
colorings pseudoachromatic number