Blocking Sets in (v, {2, 4}, 1)-Designs

@article{Batten1997BlockingSI,
  title={Blocking Sets in (v, \{2, 4\}, 1)-Designs},
  author={Lynn Margaret Batten and Kris Coolsaet and Anne Penfold Street},
  journal={Des. Codes Cryptography},
  year={1997},
  volume={10},
  pages={309-314}
}
The existence of blocking sets in (v, {2, 4}, 1)-designs is examined. We show that for v ≡ 0, 3, 5, 6, 7, 8, 9, 11 (mod 12), blocking sets cannot exist. We prove that for each v ≡ 1, 2, 4 (mod 12) there is a(v, {2, 4}, 1)design with a blocking set with three possible exceptions. The case v ≡ 10 (mod 12) is still open; we consider the first four values of v in this situation. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Blocking sets in designs, Congressus Numerantium

L. M. Batten
1994
View 1 Excerpt

Contemporary Design Theory (J

C. J. Colbourn, A. Rosa, Colorings of Block Designs
H. Dinitz and D. R. Stinson, eds.), • 1992
View 1 Excerpt

A . J . Hoffman and M . Richardson , Block design games , Canad

C. C. Lindner Hoffman
Optimal packings of K 4 ’ s into a Kn , J . Combin . Theory ( A ) Colorings of Block Designs : Contemporary Design Theory • 1991

Blocking sets and game theory, Mitt

L. Berardi, F. Eugeni
Math. Sem. Giessen , Vol • 1991
View 1 Excerpt

Asking sensitive questions indirectly

A.Y.C. Kuk
Biometrika, Vol • 1990
View 1 Excerpt

Blocking sets in (r, λ)-designs,Ars

D. Jungnickel, M. Leclerc
Combin., Vol • 1986
View 2 Excerpts

The spectrum of nested Steiner triple systems

Graphs and Combinatorics • 1985
View 1 Excerpt

Optimal Packings of K4's into a Kn

J. Comb. Theory, Ser. A • 1979
View 1 Excerpt

Similar Papers

Loading similar papers…