On defining sets of full designs with block size three
From MaRDI portal
Publication:968222
DOI10.1007/s00373-010-0882-4zbMath1205.05022OpenAlexW1979290884MaRDI QIDQ968222
Mary Waterhouse, Emine Şule Yazıcı, James G. Lefevre, Diane M. Donovan
Publication date: 5 May 2010
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0882-4
Related Items
Critical sets of full \(n\)-Latin squares, Critical sets of 2-balanced Latin rectangles, Lower bounds on the sizes of defining sets in full \(n\)-Latin squares and full designs, Defining sets of full designs with block size three. II, On the spectrum of minimal defining sets of full designs
Cites Work
- On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \(t\)-designs
- The spectrum of minimal defining sets of some Steiner systems
- On the minimum number of blocks defining a design
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item