Hostname: page-component-cb9f654ff-w5vf4 Total loading time: 0 Render date: 2025-09-09T09:50:35.548Z Has data issue: false hasContentIssue false
  • English
  • Français

Trades and defining sets: theoretical and computational results

Published online by Cambridge University Press:  17 April 2009

Colin Ramsay
Colin Ramsay
Affiliation:
Centre for Discrete Mathematics and ComputingDepartment of Computer Science and Electrical EngineeringThe University of QueenslandQueensland 4072Australia e-mail: cram@csee.uq.edu.au
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Type
Abstracts of Australasian Ph.D. Theses
Information
Bulletin of the Australian Mathematical Society , Volume 60 , Issue 1 , August 1999 , pp. 175 - 176
Copyright
Copyright © Australian Mathematical Society 1999

References

[1]Gray, B.D. and Ramsay, C., ‘On a conjecture of Mahmoodian and Soltankhah regarding the existence of (v, k, t) trades’, Ars Combin. 48 (1998), 191–194.Google Scholar
[2]Gray, B.D. and Ramsay, C., ‘On the spectrum of [v, k, t] trades’, J. Statist. Plann. Inference 69 (1998), 1–19.CrossRefGoogle Scholar
[3]Gray, B.D. and Ramsay, C., ‘On the spectrum of Steiner (v, k, t) trades (I)’, J. Combin. Math. Combin. Comput. (to appear).Google Scholar
[4]Gray, B.D. and Ramsay, C., ‘On the spectrum of Steiner (v, k, t) trades (II)’, Graphs Combin. (to appear).Google Scholar
[5]Gray, B.D. and Ramsay, C., ‘Some results on defining sets of t-designs’, Bull. Austral. Math. Soc. 59, 203–215.CrossRefGoogle Scholar
[6]Ramsay, C., ‘On a family of STS(v) whose smallest defining sets contain at least b/4 blocks’, Bull. Inst. Combin. Appl. 20 (1997), 91–94.Google Scholar
[7]Ramsay, C., ‘An algorithm for enumerating trades in designs, with an application to defining sets’, J. Combin. Math. Combin. Comput. 24 (1997), 3–31.Google Scholar
[8]Ramsay, C., ‘An algorithm for completing partials, with an application to the smallest defining sets of the STS(15)’, Utilitas Math. 52 (1997), 205–221.Google Scholar