Abstract
A mitre in a Steiner triple system is a set of five triples on seven points, in which two are disjoint. Recursive constructions for Steiner triple systems containing no mitre are developed, leading to such anti-mitre systems for at least 9/16 of the admissible orders. Computational results for small cyclic Steiner triple systems are also included.
Original language | English (US) |
---|---|
Pages (from-to) | 215-224 |
Number of pages | 10 |
Journal | Graphs and Combinatorics |
Volume | 10 |
Issue number | 2 |
DOIs | |
State | Published - Jun 1994 |
Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics