Developing an algorithm for triad design
This paper is along the theme of developing algorithmic methods to solve the difficult construction problems in block designs. To that end, a triad design \(TD(v)\) on \(v\) points is a peculiar way of listing the \(3\)-subsets of a \(v\)-set. A specific factor of the complete graph \(K_v\) is taken as a starter abd then developed to obtain a \(TD(v)\). The aim of the paper is an attempt to construct starters by considering the special cases \(v = 13\) and \(v = 19\) and the authors expect that this will help in solving the general case \(v \equiv 1 \pmod 6\).
- A computer algorithm for generating 3-designs by the method of trade off
- scientific article; zbMATH DE number 1123799
- An enumeration of triad designs
- An algorithmic approach to simultaneous triangularization
- Some new classes for triad design
- scientific article; zbMATH DE number 1304759
- Construction of 3-designs using parallelism
- An enumeration of triad designs
- Compatible factorizations and three-fold triple systems
- scientific article; zbMATH DE number 5864755 (Why is no real title available?)
- scientific article; zbMATH DE number 193109 (Why is no real title available?)
- scientific article; zbMATH DE number 979131 (Why is no real title available?)
- scientific article; zbMATH DE number 1096962 (Why is no real title available?)
This page was built for publication: Developing an algorithm for triad design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q712558)