Prescribing Automorphism Groups

Abstract

So far we have considered the problem of classifying some general families of combinatorial objects. In practice, however, one is often interested in a subfamily of these with certain additional properties. There are two possibilities for carrying out such a classification, which we have already encountered in discussing classification algorithms for resolutions of designs in Sect. 6.3: either all objects are classified and these are searched for the particular properties, or the additional properties are made inherent in the classification. The former approach can often be implemented easily using existing computer programs, but the latter approach is computationally more efficient.