Parallelisms of Complete Designs

Abstract
These notes present an investigation of a condition similar to Euclid's parallel axiom for subsets of finite sets. The background material to the theory of parallelisms is introduced and the author then describes the links this theory has with other topics from the whole range of combinatorial theory and permutation groups. These include network flows, perfect codes, Latin squares, block designs and multiply-transitive permutation groups, and long and detailed appendices are provided to serve as introductions to these various subjects. Many of the results are published for the first time.

This publication has 0 references indexed in Scilit: