Symmetries of directed graphs and the Chinese remainder theorem

It is shown that a permutation group on a finite set is the automorphism group of some directed graph if and only if a generalized Chinese remainder theorem holds for the family of stabilizers. This result can be applied to examine some special permutation groups, including the general linear groups of finite vector spaces.