No CrossRef data available.
Article contents
Trades and defining sets: theoretical and computational results
Published online by Cambridge University Press: 17 April 2009
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.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Aarticle%3AS0004972700033438/resource/name/firstPage-S0004972700033438a.jpg)
- Type
- Abstracts of Australasian Ph.D. Theses
- Information
- 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