On a generalization of the seating couples problem

From MaRDI portal




Abstract: We prove a conjecture of Adamaszek generalizing the seating couples problem to the case of 2n seats. Concretely, we prove that given a positive integer n and d1,ldots,dnin(mathbbZ/2n) we can partition mathbbZ/2n into n pairs with differences d1,ldots,dn.









This page was built for publication: On a generalization of the seating couples problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q738858)