Generating sets in Steiner triple systems
Let \(W\) be a subset of the point set \(V\) of a Steiner triple system (STS). The set \(W\) is a \(k\)-generating set, if in the Steiner quasigroup associated with the STS, every element of \(V\) can be written as a product of at most \(k\) elements of \(W\). When \(k=2\) such a generating set is a spanning or dominating set, and these have been applied in constructions of STS with complete arcs. The authors study the case \(k=3\) under the condition that every element of \(V\setminus W\) can be written in exactly one way as a product of at most 3 elements of \(W\).
- A density version of a geometric Ramsey theorem
- A new class of group divisible designs with block size three
- Balanced incomplete block designs and related designs
- scientific article; zbMATH DE number 4014740 (Why is no real title available?)
- scientific article; zbMATH DE number 426154 (Why is no real title available?)
- scientific article; zbMATH DE number 3874089 (Why is no real title available?)
- scientific article; zbMATH DE number 4150168 (Why is no real title available?)
- scientific article; zbMATH DE number 398968 (Why is no real title available?)
- scientific article; zbMATH DE number 4127214 (Why is no real title available?)
- scientific article; zbMATH DE number 1314686 (Why is no real title available?)
- Maximal Subsets of a given Set having No Triple in Common with a Steiner Triple System on the set
- On chromatic number of graphs and set-systems
- Quadratic leaves of maximal partial triple systems
- Spanning sets and scattering sets in Steiner triple systems
- The minimum independence number for designs
This page was built for publication: Generating sets in Steiner triple systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2777505)
