## Ars Combinatoria, Volume 13Department of Combinatorics and Optimization, University of Waterloo., 1982 - Combinatorial analysis |

### What people are saying - Write a review

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

### Contents

Some Elementary Isonemal Binary Matrices | 3 |

A Lower Bound for Maximal Partial Spreads in PG3q | 39 |

A Necessary But Insufficient Condition for PseudoSimilar Vertices | 55 |

Copyright | |

12 other sections not shown

### Other editions - View all

### Common terms and phrases

1-factor 1-rotational additive permutations adjoining alternate twills array Assume automorphism bipartitioned graph blocks of degree Burnside's Lemma circles of degree co-1ine collinear column Combinatorial construction contains COROLLARY corresponding cyclic degree n+1 deleted point design by deleting design minus disjoint edges elements equivalence classes equivalence relation exists FAP of order FAP's finite FSP3 graph G Graph Theory Hence implies incidence algebra incidence structure obtained infinite integer inversive plane isomorphic k-connected Kirkman triple systems Laguerre plane least LEMMA Let G Let G,P Li-spaces lines of degree Ll-space minus s points near-pencil nonbipartite order n minus packing design plane of order point in common point set projective plane Proof r-partite r-psc realisable restricted Di-spaces restricted linear space result Room rectangle Room square self-complementary graphs sequence simply inflated FAP Steiner systems Steiner triple systems Suppose symbols t-complete triangle-free graph triple systems twillins twills vertex vertices