The existence of simple \(S_ 3(3,4,\nu)\)

DOI10.1016/0012-365X(89)90364-6zbMath0681.05009OpenAlexW2012064524MaRDI QIDQ1823248

Scott A. Vanstone, Douglas R. Stinson, Kevin T. Phelps

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(89)90364-6

zbMATH Keywords

3-designconstruction

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Related Items (12)

Construction of 3-designs using \((1,\sigma)\)-resolution ⋮ Guest editorial: Special issue in honor of Scott A. Vanstone ⋮ Pure tetrahedral quadruple systems with index two ⋮ Unifying some known infinite families of combinatorial 3-designs ⋮ A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs ⋮ Optimal ternary constant-composition codes with weight four and distance three ⋮ A brief review on Egmont Köhler's mathematical work ⋮ Intersections and supports of quadruple systems ⋮ Two orthogonal 4-cycle-free one-factorizations of complete graphs ⋮ Support sizes of threefold quadruple systems ⋮ A note on two orthogonal totally \(C_4\)-free one-factorizations of complete graphs ⋮ Achromatic numbers of Kneser graphs

Cites Work

• On resolvable designs \(S_ 3(3;4,v)\)
• k-difference-cycles and the construction of cyclic t-designs
• On Some Tactical Configurations
• Unnamed Item

This page was built for publication: The existence of simple \(S_ 3(3,4,\nu)\)