Abstract
A complete arc in a design is a set of elements which contains no block and is maximal with respect to this property. The spectrum of sizes of complete arcs in Steiner triple systems is determined without exception here.
Original language | English (US) |
---|---|
Pages (from-to) | 320-333 |
Number of pages | 14 |
Journal | Journal of Combinatorial Theory. Series A |
Volume | 80 |
Issue number | 2 |
DOIs | |
State | Published - Nov 1997 |
Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics