A class of three-designs
From MaRDI portal
The author proves that the obvious necessary conditions for the existence of 3-designs with \(k = 5\) and \(\lambda=30\) are in fact sufficient. As in his previous similar results the author allows repeated blocks. Besides special construction and recursive techniques the author also uses transversal designs and pairwise balanced designs in the course of his proof.
Recommendations
Cites work
- An infinite class of 4-designs
- An infinite class of 5-designs
- Balanced incomplete block designs and related designs
- scientific article; zbMATH DE number 3503254 (Why is no real title available?)
- scientific article; zbMATH DE number 3311772 (Why is no real title available?)
- scientific article; zbMATH DE number 3369633 (Why is no real title available?)
- scientific article; zbMATH DE number 3392471 (Why is no real title available?)
- New 5-designs
- On Some Tactical Configurations
- Some 3-designs and a 4-design
- Some New 5-Designs
- Symmetry codes over GF(3) and new five-designs
Cited in
(52)- 2-idempotent 3-quasigroups with a conjugate invariant subgroup consisting of a single cycle of length four.
- Constructions for generalized Steiner systems \(\mathrm{GS}(3,4,v,2)\)
- Self-converse large sets of pure Mendelsohn triple systems
- Uniformly resolvable three-wise balanced designs with block sizes four and six
- The family of t-designs. Part I
- Some perpendicular arrays for arbitrarily large \(t\)
- \(t\)-divisible designs from imprimitive permutation groups
- The fundamental construction for 3-designs
- A construction for orthogonal arrays with strength t 3
- On large sets of Kirkman triple systems and 3-wise balanced design.
- On the construction of authentication and secrecy codes
- On the 3BD-closed set \(B_3(\{4,5\})\)
- A construction for Steiner 3-designs
- On the fibre product of incidence structures
- Suitable sets of permutations, packings of triples, and Ramsey's theorem
- Large sets of Kirkman triple systems of orders \(2^{2 n + 1} + 1\)
- Further study on optimal data placements for triple replication
- New results on LR-designs and OLKTSs
- Existence of Steiner quadruple systems with an almost spanning block design
- A construction for large sets of disjoint Kirkman triple systems
- Constructions for large sets of \(L\)-intersecting Steiner triple systems
- A unified approach to combinatorial key predistribution schemes for sensor networks
- New large sets of resolvable Mendelsohn triple systems
- The spectrum for overlarge sets of directed triple systems
- Asymptotic determination of the last packing number of quadruples
- A new existence proof for large sets of disjoint Steiner triple systems
- Existence of optimal strong partially balanced 3-designs with block size four
- Some new infinite classes of candelabra quadruple systems
- The existence of well-balanced triple systems
- P3BD-closed sets
- A completion of the spectrum for the overlarge sets of pure Mendelsohn triple systems
- Existence of q-analogs of Steiner systems
- A new infinite class of S(3, {4, 5, 7}, v)
- scientific article; zbMATH DE number 4174937 (Why is no real title available?)
- An improvement on H design
- The spectrum for overlarge sets of hybrid triple systems
- The completion determination of optimal \((3,4)\)-packings
- On the existence of \(S(3,\{4,5,7\},v)\)
- A construction for infinite families of Steiner 3-designs
- The existence spectrum for overlarge sets of pure hybrid triple systems
- Large sets of extended directed triple systems with odd orders
- New infinite classes of 2‐chromatic Steiner quadruple systems
- Pure tetrahedral quadruple systems with index two
- The existence spectrum for overlarge sets of pure directed triple systems
- Special overlarge sets of Kirkman triple systems
- An alternative existence proof for \(\mathrm{LSTS}(24k+1)\)
- Hypercycle systems from semi-parallel classes
- Candelabra systems and designs
- Super-simple balanced incomplete block designs with block size 5 and index 8
- Existence of Steiner quadruple systems with a spanning block design
- Purely tetrahedral quadruple systems
- The combinatorics of authentication and secrecy codes
This page was built for publication: A class of three-designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1252859)
