## Ars Combinatoria, Volumes 24-25Department of Combinatorics and Optimization, University of Waterloo., 1987 - Combinatorial analysis |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

A Note on Partitioned Balanced Tournament Designs by F R Lamken | 5 |

Terraces for Groups by CX Nilrat and C E Praeger | 17 |

On Large Sets of Disjoint Ordered Designs by Luc Tcirlinck | 31 |

Copyright | |

33 other sections not shown

### Common terms and phrases

adjacent array association scheme automorphism group balanced tournament designs bigeodetic blocking set cells chordal graphs colours columns Combinatorial complete graph conjecture connected graph consider construction contains Corollary cycle of length defined degree deleting denote DERIVED STS diameter digraph Discrete Math disjoint distinct edge-reconstruction elements exactly exists finite frame of type geodetic block graph G Graph Theory GROUP ORDER hamiltonian Hence hypergraphs hyperplane skew incident integer intersecting isomorphic Kirkman triple systems labelled Latin squares Lemma Let G linear low-density burst matrix minimum modulo multigraph nonhamiltonian graph obtained oooooo orthogonal designs pair parallel class partition path pentagon permutation planar graphs plane of order points polynomial positive integer problem projective plane Proof Proposition prove quadrilateral result sequence skew frame Steiner systems Steiner triple systems sub-block subgraph of G subplane subsets Suppose symmetric system of order Theorem trees triangle Vanstone vertex vertices