## Combinatorial mathematics V: proceedings of the Fifth Australian Conference, held at the Royal Melbourne Institute of Technology, Aug. 24-26, 1976 |

### What people are saying - Write a review

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

### Contents

Introduction | 2 |

Free Groups | 8 |

The Kurosh Subgroup Theorem | 14 |

Copyright | |

1 other sections not shown

### Other editions - View all

### Common terms and phrases

adjacency matrix adjacent Burnside's Lemma Cayley graph circuits of S1 circulant matrices colouring combinatorial components connected graph consider construction contains convex hull Corollary corresponding cosets cospectral graphs cycle cyclic defined denote Department of Mathematics design of order design of type diagonal disjoint eigenvalues elements endpoints equation exactly exists Figure finite index free group free product Geramita GGS matrix given Goethals-Seidel graph G Hence homomorphism inclusion-exclusion principle integer isomorphic Jennifer Seberry Jennifer Seberry Wallis labeled acyclic digraphs Latin square Lemma Let G line graph loop Math matrix of type maximal obtain orthogonal designs out-points pair permutation planar planar graph points problem Proof regular graphs renewal array result ring satisfies semi-stable skew Room square skew squares spanning tree square of side Steiner triple system strongly regular graphs subgraph sum-free sets Suppose switches symmetric Theory triangle unlabeled vertex set