scientific article; zbMATH DE number 140058
[For the entire collection see Zbl 0748.00018.] In this paper, a triple in a Steiner triple system (STS) is called a line. Let \(C\) be a configuration consisting of four lines. Then it is known that there are 16 such configurations \(C_ i(i=1,\dots,16)\). The question is: Given any \(C_ i\), for which values of \(v\) (the number of vertices) is there an STS whose set of lines can be decomposed into copies of \(C_ i\)? It is easy to show that a necessary condition is \(v\equiv 1\) or 9 (mod 24). The authors show that for 10 of the configurations \(C_ i\) the values of \(v\) can be determined completely (that is, \(v\geq 9\) or \(v\geq 25\), depending on i). For the other 6 configurations the results are similar, except that the value \(v=81\) is in doubt.
- Partitioning linear spaces into complete quadrilaterals and n-gons
- Steiner triple systems of order 19 associated with a certain type of projective plane of order 10
- Decompositions of complete graphs into circulants
- scientific article; zbMATH DE number 431053 (Why is no real title available?)
- Archimedean graph designs
- Decomposing the complete graph into dodecahedra
- Ubiquitous configurations in Steiner triple systems
- scientific article; zbMATH DE number 638679 (Why is no real title available?)
- A small basis for four‐line configurations in steiner triple systems. Dedicated to the memory of gemma holly griggs
- scientific article; zbMATH DE number 908564 (Why is no real title available?)
- Trinal decompositions of Steiner triple systems into triangles
- scientific article; zbMATH DE number 1409201 (Why is no real title available?)
- Archimedean graph designs. II.
- Steiner triple systems satisfying the 4-vertex condition
- Design spectra for 6-regular graphs with 12 vertices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028433)