2-designs having an intersection number k − n
- 31 January 1980
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 28 (1) , 64-81
- https://doi.org/10.1016/0097-3165(80)90059-x
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- An infinite family of symmetric designsDiscrete Mathematics, 1979
- A construction method for point divisible designsJournal of Statistical Planning and Inference, 1978
- On Strong Tactical DecompositionsJournal of the London Mathematical Society, 1977
- Some designs which admit strong tactical decompositionsJournal of Combinatorial Theory, Series A, 1977
- On resolutions and bose's theoremGeometriae Dedicata, 1976
- Graph Theory, Coding Theory and Block DesignsPublished by Cambridge University Press (CUP) ,1975
- SYMMETRIC HADAMARD MATRICES OF ORDER 36Annals of the New York Academy of Sciences, 1970
- Strongly Regular Graphs Derived from Combinatorial DesignsCanadian Journal of Mathematics, 1970
- On some Theorems in Combinatorics Relating to Incomplete Block DesignsThe Annals of Mathematical Statistics, 1953
- The 3-Space PG(3,2) and Its GroupAnnals of Mathematics, 1910