
Abstract An OLRMTS ( v ) ( OLARMTS ( v ) ) over a ( v + 1 ) -set X is a collection { ( X ∖ { x } , B x ) : x ∈ X } of v + 1 pairwise disjoint resolvable (almost resolvable) Mendelsohn triple systems of order v . In this paper several direct construction methods for OLRMTSs and OLARMTSs are presented and then applied to produce some new orders; the smallest unknown OLRMTS ( v ) for v = 18 , 24 , the smallest unknown OLARMTS ( v ) for v = 19 , 22 , 28 , 31 , and some other small designs are displayed; a few new existence families are also obtained by known recursive constructions.
Discrete Mathematics and Combinatorics, Theoretical Computer Science
Discrete Mathematics and Combinatorics, Theoretical Computer Science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
