Premium
On sparse countably infinite Steiner triple systems
Author(s) -
Chicot K. M.,
Grannell M. J.,
Griggs T. S.,
Webb B. S.
Publication year - 2010
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.20227
Subject(s) - mathematics , steiner system , combinatorics , countable set , point (geometry) , set (abstract data type) , discrete mathematics , computer science , geometry , programming language
We give a general construction for Steiner triple systems on a countably infinite point set and show that it yields 2 ℵ 0nonisomorphic systems all of which are uniform and r ‐sparse for all finite r ⩾4. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 115–122, 2010
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom