Complete Arcs in Steiner Triple Systems

Charles J. Colbourn, Jeffrey H. Dinitz

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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 languageEnglish (US)
Pages (from-to)320-333
Number of pages14
JournalJournal of Combinatorial Theory. Series A
Volume80
Issue number2
DOIs
StatePublished - Nov 1 1997
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Complete Arcs in Steiner Triple Systems'. Together they form a unique fingerprint.

Cite this