Universal commutator graphs (Q2276972)

Let G be a group, S a subset of G and C(G,S) the (commutator) graph with vertex set S and x adjacent to y if \(xy=yx\). The author proves: There is a sequence of groups G(n) of order \(6^ n\) such that every graph with n vertices is isomorphic to C(G(n),S(n)) for some subset S(n) (depending on the graph) with n elements of G(n). [Compare also with \textit{R. Scapellato}, Commutativity graphs of groups, Rend. Accad. Naz. Sci. Detta XL, V. Ser. 12, No.1, 333-347 (1988; see review 05026 in this volume).]