Skip to main content
Journal ArticleOPEN ACCESS

Complete Arcs in Steiner Triple Systems

Journal of Combinatorial Theory. Series A (1997) 80(2) 320-333
DOI: 10.1006/jcta.1997.2834
1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 1997 Academic Press.

Cite

CITATION STYLE

APA

Colbourn, C. J., & Dinitz, J. H. (1997). Complete Arcs in Steiner Triple Systems. Journal of Combinatorial Theory. Series A, 80(2), 320–333. https://doi.org/10.1006/jcta.1997.2834

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free