The Open UniversitySkip to content

Independent sets in Steiner triple systems

Forbes, A.D.; Grannell, M.J. and Griggs, T.S. (2004). Independent sets in Steiner triple systems. Ars Combinatoria, 72 pp. 161–169.

Google Scholar: Look up in Google Scholar


A set of points in a Steiner triple system $({\rm STS}(v))$ is said to be independent if no three of these points occur in the same block. In this paper we derive for each $k\le8$ a closed formula for the number of independent sets of cardinality $k$ in an ${\rm STS}(v)$. We use the formula to prove that every STS(21) has an independent set of cardinality eight and is as a consequence 4-colourable.

Item Type: Journal Article
Copyright Holders: 2004 Not known
ISSN: 0381-7032
Academic Unit/Department: Mathematics, Computing and Technology > Mathematics and Statistics
Mathematics, Computing and Technology
Related URLs:
Item ID: 2906
Depositing User: Terry Griggs
Date Deposited: 05 Mar 2007
Last Modified: 14 Jan 2016 15:51
Share this page:

▼ Automated document suggestions from open access sources

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340