## Ars Combinatoria, Volumes 3-4Department of Combinatorics and Optimization, University of Waterloo., 1977 - Combinatorial analysis |

### What people are saying - Write a review

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

### Contents

CONTENTS TONE | 3 |

Regular Representation of Abelian Groups by 3Unifonn Hypergraphs | 15 |

6Sets in Finite Groups and Representation by 3Uniform Hypergraphs | 6 |

Copyright | |

20 other sections not shown

### Other editions - View all

### Common terms and phrases

1-factor 1-transitive 3m+l 6-cycles adjacent array assume Aut G(b automorphism BIBD blocks of type clique colours column Combinatorial Theory comma-free code common letter complement complete graph consider construction contains contradiction COROLLARY Coxeter group cyclic decomposition defined denote diameter edgesum problem elements Euclidean graph exactly example exists extremal graphs finite follows Fx+Fy graph G Graph Theory Hadamard matrices Hence hypergraph implies incidence matrix integer isomorphic Jennifer Seberry least Lemma Let G linear code Math n-colouring nondegenerate Note number of edges obtained occur ordered pairs orthogonal designs orthogonal Latin squares parallel classes parameters partition path of length permutation points polynomial proof of Theorem prove resolvable quadruple system result Room squares satisfies self-orthogonal Latin square square of order stability order Steiner Steiner system subgraph subsets subsquare Suppose symmetric triple systems University of Waterloo Vanstone varieties of type vertex Waterloo