 The Resolvable Coverings problem considers the general formula_1 girls, formula_7 groups case where each pair of girls must be in the same group at some point, but we want to use as few days as possible.This can, for example, be used to schedule a rotating table plan, in which each pair of guests must at some point be at the same table.The Oberwolfach problem, of decomposing a complete graph into edge-disjoint copies of a given 2-regular graph, also generalizes Kirkman's schoolgirl problem.