We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Centre for Discrete Mathematics and ComputingDepartment of Computer Science and Electrical EngineeringThe University of QueenslandQueensland 4072Australia e-mail: [email protected]
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.
[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]
[2]Gray, B.D. and Ramsay, C., ‘On the spectrum of [v, k, t] trades’, J. Statist. Plann. Inference69 (1998), 1–19.CrossRefGoogle Scholar
[3]
[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]
[4]Gray, B.D. and Ramsay, C., ‘On the spectrum of Steiner (v, k, t) trades (II)’, Graphs Combin. (to appear).Google Scholar
[5]
[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]
[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]
[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]
[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