Direct product of automorphism groups of colored graphs Original Research Article

The concrete representation problem asks if a permutation group G on a set X is equal (permutation isomorphic) to the automorphism group of some colored graph with vertex set X. In this paper we consider how the representability of the direct product of permutation groups is connected with the representability of the factors.