The number of repeated blocks in twofold triple systems (Q1074583)

A twofold triple system, or TTS, is a blocks design (v, \(k=3\), \(\lambda =2)\). Designs with \(\lambda =2\) frequently have peculiar properties. In this case, whenever \(v\equiv 1,3 (mod 6)\) a very easy TTS on v elements may be obtained by using each block twice of an ordinary Steiner triple system, or design (v, \(k=3\), \(\lambda =1)\), which exist for all such v. In Discrete Math. 8, 105-109 (1974; Zbl 0276.05021), \textit{J. van Buggenhaut} has shown that for all \(v\equiv 0,1 (mod 3)\) there are TTS with no repeated blocks. In this interesting paper the authors completely answer the question ''given b, which k can be achieved as the exact number of repeated blocks ?''. Very loosely speaking, the answer is that k can be just about anything up to half the number of blocks. The paper is largely constructive and only very rarely falls back on the bete noire of combinatorics ''an exhaustive search reveals''.