Large sets of disjoint t-designs

@article{Chee1990LargeSO,
  title={Large sets of disjoint t-designs},
  author={Yeow Meng Chee and Charles J. Colbourn and Steven Furino and Donald L. Kreher},
  journal={Australasian J. Combinatorics},
  year={1990},
  volume={2},
  pages={111-120}
}
[u this paper, we show how the basis reduction algorithm of Kreher and Radziszowski can be used to construct large sets of disjoint designs with specified automorphisms. In particular, we construct a (3,4,23;4)large set which rise to an infinite family of large sets of 4-desiglls via a result of Teirlinck [6]. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Finding Simple t-Designs by Basis Reduction

  • D. L. Kreher, S. P. Radziszowski
  • Congressus Numerantium 55
  • 1986
Highly Influential
6 Excerpts

Permutation Groups and Combinatorial Structures (Cambridge University Press: London Mathematical Society Lecture Note Series

  • N. L. Biggs, A. T. White
  • 1979
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…