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 seats. Concretely, we prove that given a positive integer and we can partition into pairs with differences .
Recommendations
Cites work
Cited in
(9)- Partitions of nonzero elements of a finite field into pairs
- New methods to attack the Buratti-Horak-Rosa conjecture
- Seating couples around the king's table and a new characterization of prime numbers
- On partitioning \(\mathbb Z_m\) into pairs of prescribed differences
- The seating couples problem in the even case
- Finding a perfect matching of \(\mathbb{F}_2^n\) with prescribed differences
- Finding pairwise disjoint vector pairs in \(\mathbb{F}_2^n\) with a prescribed sequence of differences (extended abstract)
- Construction techniques for linear realizations of multisets with small support
- On a generalization of the seating couples problem
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)