The existence of cyclic (v, 4, 1)-designs

Designs, Codes and Cryptography - Even though Peltesohn proved that a cyclic (v, 3, 1)-design exists if and only if $$v\equiv 1,3\pmod {6}$$ as early as 1939, the problem of...