Inhaltsverzeichnis
Introduction; 1. The existence theorem; Appendix: the integrity theorem for network flows; 2. The parallelogram property; Appendix: the binary perfect code theorem; Appendix: association schemes and metrically regular graphs; 3. Steiner points and Veblen points; Appendix: Steiner systems; 4. Minimal edge-colourings of complete graphs; Appendix: latin squares, SDRs and permanents; 5. Biplanes and metric regularity; Appendix: symmetric designs; 6. Automorphism groups; Appendix: multiply transitive groups; 7. Resolutions and partition systems; Bibliography; Index.