We survey the status of minimal coverings of pairs with block sizes two, three, and four when \(\lambda = 1\), that is, all pairs from a \(v\)-set are covered exactly once. Then we provide a complete solution for the case \(\lambda = 2\).
1970-2025 CP (Manitoba, Canada) unless otherwise stated.