The equipartite Oberwolfach problem with uniform tables

We consider the following generalization of the Oberwolfach problem: “At a gathering there are n delegations each having m people. Is it possible to arrange a seating of mn people present at s round tables T1,T2,…,Ts (where each Ti can accommodate ti⩾3 people and ∑ti=mn) for k different meals so that each person has every other person not in the same delegation for a neighbor exactly once?”. In this paper, we give a complete solution to the problem when all tables accommodate the same number t of people, thereby extending the well-known result on the original Oberwolfach problem.