Ars Combinatoria, Volumes 21-23Department of Combinatorics and Optimization, University of Waterloo., 1986 - Combinatorial analysis |
Contents
BIBD 937 take out simple BIBD 932 which is given in Appendix A | 9 |
402 | 93 |
126 | 105 |
Copyright | |
15 other sections not shown
Other editions - View all
Common terms and phrases
adjacent algorithm array B₁ BIB design block design C₁ cell chromatic Colbourn color columns Combinatorial complete graph Computer configuration connected consider construction contains contradiction copies Corollary cubic graphs cycle cyclic D₁ decomposition define denote digraphs Discrete Math disjoint edges elements embedding entries exactly example exists F₁ Figure finite G₁ given graph G Graph Theory hamiltonian Hence homeomorph idempotent implies incident induced subgraph integer intersection isomorphic k-edge-colouring latin square Lemma length Let G lines lower bound Mathematics matrix matroid modulo n-planes Note NP-complete obtain one-factors orthogonal pair pairwise parallel class parameters partition paths permutation points positive integer problem projective plane Proof Proposition prove quasigroup reliability polynomial result Seberry sequence set in class simple BIBD Steiner systems Steiner triple systems subsets Suppose symmetric tactical decomposition Theorem tree triangle unique vertex vertices wi+j+k wk+l zero