Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-25T08:34:38.672Z Has data issue: false hasContentIssue false

Some results on a combinatorial problem of Cordes

Published online by Cambridge University Press:  09 April 2009

D. McCarthy
Affiliation:
University of Waterloo, Waterloo, Ontario, Canada
G. H. J. van Rees
Affiliation:
University of Waterloo, Waterloo, Ontario, Canada
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Cordes (1976) introduced the problem of determining the maximum number of resolution classes of a finite set partitioned into equicardinal subsets such that the number of pairs common to any 2 classes is minimized. A later paper of Mullin and Stanton (1976) investigated those conditions under which the configurations were actually BIBD's. They obtained a bound for these special configurations and conjectured it applied in general. We prove this in the present paper. A recursive and a direct construction are also given for a special class of configurations.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1977

References

Bose, R. C. (1947), ‘On a resolvable series of balanced incomplete designs’, Sankhyā 8, 249256.Google Scholar
Cordes, C. (submitted), ‘A new type of combinatorial design’, Canadian Journal of Mathematics.Google Scholar
Mullin, R. C., and Stanton, R. G. (to appear), ‘A characterization of Pseudo-affine designs and their relation to a problem of Cordes’, Annals of Discrete Mathematics.Google Scholar
Wallis, W. D., Street, A. P., and Wallis, J. S. (1972), Combinatorics: Room squares, sum-free sets, Hadamard matrices (Lecture Notes in Mathematics 292, Springer-Verlag, Berlin).CrossRefGoogle Scholar