## Ars Combinatoria, Volumes 26-27Department of Combinatorics and Optimization, University of Waterloo., 1988 - Combinatorial analysis |

### What people are saying - Write a review

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

### Contents

R Rees and D R Stinson Kirkman triple systems with maximum subsystems | 11 |

oooco334 | 3 |

R Rees and D R Stinson On combinatorial designs with subdesigns Annals | 12 |

Copyright | |

3 other sections not shown

### Common terms and phrases

3-connected cubic graph 3-snakes 4-cycle adjacent apply Lemma array automorphism balanced ternary BIBD bicover of order bipartite bipartite graph codes column Combinatorial complete graph components consider construction Corollary coset cubic graph cycle in G cyclic define delete denote disjoint distinct elements entries exactly example exists Figure finite frame of type gap sequence triple GBRD GF(q given graph G Graph Theory Hadamard matrices Hence IGDD incidence matrix integer isomorphic Jennifer Seberry least Lemma Let G Math Mathematics matroid maximal minimal covers modular cut modulo multi-3-gon notation obtain occurs one-factor one-point orthogonal Latin squares pair parallel classes parameters partition periodic gap sequence permutation polynomials primal graphs prime implicants prime power prove result Seberry Section Steiner Steiner triple systems subgraph subgroup subset Suppose symmetric Table tactical decomposition Theorem Theory trees triangle triple system unique vectors vertex vertices of degree zero-hole