The Open UniversitySkip to content

On sparse countably infinite Steiner triple systems

Chicot, K. M.; Grannell, M. J.; Griggs, T. S. and Webb, B. S. (2010). On sparse countably infinite Steiner triple systems. Journal of Combinatorial Designs, 18(2) pp. 115–122.

DOI (Digital Object Identifier) Link:
Google Scholar: Look up in Google Scholar


We give a general construction for Steiner triple systems on a countably infinite point set and show that it yields 2N0 nonisomorphic systems all of which are uniform and r-sparse for all finite r≥4.

Item Type: Journal Article
ISSN: 1063-8539
Keywords: infinite Steiner triple system; sparse; uniform
Academic Unit/Department: Mathematics, Computing and Technology > Mathematics and Statistics
Mathematics, Computing and Technology
Item ID: 21313
Depositing User: Colin Smith
Date Deposited: 13 May 2010 09:40
Last Modified: 15 Jan 2016 12:43
Share this page:


Scopus Citations

▼ Automated document suggestions from open access sources

Actions (login may be required)

Policies | Disclaimer

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