## Ars Combinatoria, Volume 26Department of Combinatorics and Optimization, University of Waterloo., 1988 - Combinatorial Analysis |

### From inside the book

Try this search over all volumes: **bipartite**

Results 1-0 of 0

### What people are saying - Write a review

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

### Contents

Aldred R E Dept of Mathematics University of Otago P O Box 56 Dunedin | 6 |

Maximal qary Codes and Plotkins Bound | 37 |

Partitioning Sets of Triples into Designs by MJ Sharry and A P Street | 51 |

Copyright | |

12 other sections not shown

### Other editions - View all

### Common terms and phrases

3-colouring adjacent apply Lemma automorphism group balanced ternary Bhaskar Rao designs binomial binomial coefficients bipartite CBTD[p chromatically unique codewords Combinatorial conjugate invariant subgroup construction containing Corollary coset coset graph cubic graph cyclic define denote disjoint edge edge-maximal elements entries equations example exists Fano plane finite field fixes gap sequence triple GBRD give given graph G Hadamard matrices Hamming code Hence hole induced infinite integer flow isomorphic Jennifer Seberry Latin squares Lemma Let G Math Mathematics matroid minimal covers modular cut modulo near-polygonal graph obtain orientation orthogonal PA(n pair partition pentagon system perfect codes periodic gap sequence permutation perpendicular array points weight polynomials prime implicants problem Proof quadruples quaslgroup regulus of rank result Section Segre variety Steiner triple systems subgraph subspace Suppose symmetric Table Theorem Theory valency vectors vertex sequence vertex transitive vertices zero-hole