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

### What people are saying - Write a review

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

### Contents

An Improved Algorithm for Determining Optimal Sums of Disjoint | 5 |

Determining Generalized Ramsey Numbers is NPHard by S A Burr | 21 |

Graphs Decomposable Into Paths of Length At Least Three by L Weixuan | 27 |

Copyright | |

17 other sections not shown

### Other editions - View all

### Common terms and phrases

2-fold perfect A-basis Abrham adjugate affine plane Anne Penfold Axiom BCLSs CLSs codewords of weight collinear columns Combinatorial complete graph complete mapping compound twillins Computer consider construction contains contradiction Corollary cyclic Latin squares decomposable into long defined denote diagonal Discrete Mathematics disjoint elements exists fixed codewords follows frame G is decomposable GF(q Graph Theory greedy algorithm Hadamard matrix hamiltonian cycles Hence Huffman's algorithm idempotent incidence structure incident integer intersection isonemal Kotzig Lemma lines long paths matrix Mendelsohn design obtain occur orbit orthogonal Latin squares oval pair parallel classes paths of length pension set plane of order pn(T point in common problem Proof properties prove quasigroups ramsey number result sequence Steiner triple systems STS of order subspace Suppose symmetric A bases symmetric additive permutations t t t Table Theorem translation plane unique vector vertices