Name
Abstract | ||
|---|---|---|
A Steiner triple system of order v, an STS(v), is a set of 3-element subsets, called blocks, of a v-element set of points, such that every pair of distinct points occurs in exactly one block. A subsystem of order w in an STS(v), a sub-STS(w), is a subset of blocks that forms an STS(w). Constructive and nonconstructive techniques for enumerating up to isomorphism the STS(v) that admit at least one sub-STS(w) are presented here for general parameters v and w. The techniques are further applied to show that the number of isomorphism classes of STS(21)s with at least one sub-STS(9) is 12661527336 and of STS(27) s with a sub-STS(13) is 1356574942538935943268083236. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1090/mcom/2945 | MATHEMATICS OF COMPUTATION |
Keywords | Field | DocType |
Classification,enumeration,Steiner triple system,subsystem | Discrete mathematics,Monad (category theory),Enumeration,Mathematics,Steiner system | Journal |
Volume | Issue | ISSN |
84 | 296 | 0025-5718 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Petteri Kaski | 1 | 912 | 66.03 |
| Patric R. J. Östergård | 2 | 609 | 70.61 |
| Alexandru Popa | 3 | 70 | 13.34 |