Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-24T22:52:30.023Z Has data issue: false hasContentIssue false
  • English
  • Français

97.35 A Problem of sociable dining

Published online by Cambridge University Press:  23 January 2015

A. Donald Keedwell
A. Donald Keedwell*
Affiliation:
Department of Mathematics, University of Surrey, Gulidford GU2 7XH
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Notes 97.17 to 97.38
Information
The Mathematical Gazette , Volume 97 , Issue 539 , July 2013 , pp. 311 - 315
Copyright
Copyright © The Mathematical Association 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Fisher, R. A., The Design of Experiments, (9th edn.) Macmillan (1971).Google Scholar
2. Anderson, I., Combinatorial designs and tournaments, (Oxford Lecture Series in Mathematics and its Applications, 6), Clarendon Press, Oxford (1997)Google Scholar
3. Ryser, H. J., Combinatorial Mathematics, (Carus Mathematical Monongraphs, No.14), MAA(1963).Google Scholar
4. Wallis, W. D., Introduction to combinatorial designs (2nd edn.) Chapman and Hall/CRC (2007).Google Scholar
5. Wallis, W. D., Combinatorial designs (Monographs and Textbooks in Pure and Applied Mathematics, 118) Marcel Dekker, New York, (1988).Google Scholar