Vertex-coloring edge-weighting of complete \(r\)-partite graphs (Q2870955)

The authors provide a partial solution to the well-known 1-2-3 conjecture of \textit{M. Karoński} et al. [J. Comb. Theory, Ser. B 91, No. 1, 151--157 (2004; Zbl 1042.05045)]. Namely, they prove that in the case of a complete \(r\)-partite graph with \(n_i\) vertices in the \(i\)th partition sets, \(i=1,2,\dots, r\), the minimum number of colors needed to distinguish the vertex-weighted degrees is \(1\) when all \(n_i\) are distinct, \(3\) when \(n_1=n_2=\dots =n_r=1\), and \(2\) otherwise.