A Completion of the spectrum of 3-way $(v,k,2)$ Steiner trades

A 3-way $(v,k,t)$ trade $T$ of volume $m$ consists of three pairwise disjoint collections $T_1$, $T_2$ and $T_3$, each of $m$ blocks of size $k$, such that for every $t$-subset of $v$-set $V$, the number of blocks containing this $t$-subset is the same in each $T_i$ for $1\leq i\leq 3$. If any $t$-subset of found($T$) occurs at most once in each $T_i$ for $1\leq i\leq 3$, then $T$ is called 3-way $(v,k,t)$ Steiner trade. We attempt to complete the spectrum $S_{3s}(v,k)$, the set of all possible ...