Journal article
On a variation of the Oberwolfach problem
Abstract
We consider the following “spouse-avoiding” variant of the Oberwolfach problem (briefly NOP): “At a gathering there are n couples. Is it possible to arrange a seating for the 2n people present at s round tables T1,T2,…,Ts (where Ti can accomodate ki ⩾ 3 people and Σki=2n) for m different meals so that each person has every other person except his spouse for a neighbour exactly once?” We prove several results concerning the existence of …
Authors
Huang C; Kotzig A; Rosa A
Journal
Discrete Mathematics, Vol. 27, No. 3, pp. 261–277
Publisher
Elsevier
Publication Date
December 1979
DOI
10.1016/0012-365x(79)90162-6
ISSN
0012-365X