All block designs with \(b={v\choose k}/2\) exist (Q1377704)

A \(t\)-design \((X, {\mathcal B})\) is halvable if \({\mathcal B}\) can be partitioned into two parts of equal size, \({\mathcal B}_1\) and \({\mathcal B}_2\), so that \((X, {\mathcal B}_i)\) is a \(t\)-design for \(i= 1, 2\). \textit{A. Hartman} [Ann. Discrete Math. 34, 207-224 (1987; Zbl 0643.05013)] has conjectured that the complete \(t\)-design is halvable if and only if certain trivial arithmetic conditions are satisfied. In this paper the above conjecture is proved to be true for \(t=2\) by using some constructions for large sets of designs.