On the minisymposium problem
On the minisymposium problem
The generalized Oberwolfach problem asks for a factorization of the complete graph Kv into prescribed 2-factors and at most a 1-factor. When all 2-factors are pairwise isomorphic and v is odd, we have the classic Oberwolfach problem, which was originally stated as a seating problem: given v attendees at a …