# Ménage problem A table with ten place settings. There are 3120 different ways in which five male-female couples can sit at this table such that men and women alternate and nobody sits next to their partner.

In combinatorial mathematics, the ménage problem or problème des ménages asks for the number of different ways in which it is possible to seat a set of male-female couples at a dining table so that men and women alternate and nobody sits next to his or her partner. This problem was formulated in 1891 by Édouard Lucas and independently, a few years earlier, by Peter Guthrie Tait in connection with knot theory. For a number of couples equal to 3, 4, 5, ... the number of seating arrangements is

12, 96, 3120, 115200, 5836320, 382072320, 31488549120, ... (sequence A059375 in the OEIS).

Mathematicians have developed formulas and recurrence equations for computing these numbers and related sequences of numbers. Along with their applications to etiquette and knot theory, these numbers also have a graph theoretic interpretation: they count the numbers of matchings and Hamiltonian cycles in certain families of graphs.

## Touchard's formula

Let Mn denote the number of seating arrangements for n couples. Touchard (1934) derived the formula

$M_{n}=2\cdot n!\sum _{k=0}^{n}(-1)^{k}{\frac {2n}{2n-k}}{2n-k \choose k}(n-k)!.$ Much subsequent work has gone into alternative proofs for this formula and into various generalized versions of the problem.

A different umbral formula for Mn involving Chebyshev polynomials of first kind was given by Wyman & Moser (1958).

## Ménage numbers and ladies-first solutions

There are 2×n! ways of seating the women: there are two sets of seats that can be arranged for the women, and there are n! ways of seating them at a particular set of seats. For each seating arrangement for the women, there are

$A_{n}=\sum _{k=0}^{n}(-1)^{k}{\frac {2n}{2n-k}}{2n-k \choose k}(n-k)!$ ways of seating the men; this formula simply omits the 2×n! factor from Touchard's formula. The resulting smaller numbers (again, starting from n = 3),

1, 2, 13, 80, 579, 4738, 43387, 439792, ... (sequence A000179 in the OEIS)

are called the ménage numbers. The factor ${\frac {2n}{2n-k}}{2n-k \choose k}$ is the number of ways of forming k non-overlapping pairs of adjacent seats or, equivalently, the number of matchings of k edges in a cycle graph of 2n vertices. The expression for An is the immediate result of applying the principle of inclusion–exclusion to arrangements in which the people seated at the endpoints of each edge of a matching are required to be a couple.

Until the work of Bogart & Doyle (1986), solutions to the ménage problem took the form of first finding all seating arrangements for the women and then counting, for each of these partial seating arrangements, the number of ways of completing it by seating the men away from their partners. Bogart and Doyle argued that Touchard's formula may be derived directly by considering all seating arrangements at once rather than by factoring out the participation of the women. However, Kirousis & Kontogeorgiou (2018) found the even more straightforward ladies-first solution described above by making use of a few of Bogart and Doyle's ideas (although they took care to recast the argument in non-gendered language).

The ménage numbers satisfy the recurrence relation

$A_{n}=nA_{n-1}+{\frac {n}{n-2}}A_{n-2}+{\frac {4(-1)^{n-1}}{n-2}}$ and the simpler four-term recurrence

$\displaystyle A_{n}=nA_{n-1}+2A_{n-2}-(n-4)A_{n-3}-A_{n-4},$ from which the ménage numbers themselves can easily be calculated.

## Graph-theoretical interpretations Crown graphs with six, eight, and ten vertices. The outer cycle of each graph forms a Hamiltonian cycle; the eight and ten-vertex graphs also have other Hamiltonian cycles.

Solutions to the ménage problem may be interpreted in graph-theoretic terms, as directed Hamiltonian cycles in crown graphs. A crown graph is formed by removing a perfect matching from a complete bipartite graph Kn,n; it has 2n vertices of two colors, and each vertex of one color is connected to all but one of the vertices of the other color. In the case of the ménage problem, the vertices of the graph represent men and women, and the edges represent pairs of men and women who are allowed to sit next to each other. This graph is formed by removing the perfect matching formed by the male-female couples from a complete bipartite graph that connects every man to every woman. Any valid seating arrangement can be described by the sequence of people in order around the table, which forms a Hamiltonian cycle in the graph. However, two Hamiltonian cycles are considered to be equivalent if they connect the same vertices in the same cyclic order regardless of the starting vertex, while in the ménage problem the starting position is considered significant: if, as in Alice's tea party, all the guests shift their positions by one seat, it is considered a different seating arrangement even though it is described by the same cycle. Therefore, the number of oriented Hamiltonian cycles in a crown graph is smaller by a factor of 2n than the number of seating arrangements, but larger by a factor of (n − 1)! than the ménage numbers. The sequence of numbers of cycles in these graphs (as before, starting at n = 3) is

2, 12, 312, 9600, 416880, 23879520, 1749363840, ... (sequence A094047 in the OEIS).

A second graph-theoretic description of the problem is also possible. Once the women have been seated, the possible seating arrangements for the remaining men can be described as perfect matchings in a graph formed by removing a single Hamiltonian cycle from a complete bipartite graph; the graph has edges connecting open seats to men, and the removal of the cycle corresponds to forbidding the men to sit in either of the open seats adjacent to their wives. The problem of counting matchings in a bipartite graph, and therefore a fortiori the problem of computing ménage numbers, can be solved using the permanents of certain 0-1 matrices. In the case of the ménage problem, the matrix arising from this view of the problem is the circulant matrix in which all but two adjacent elements of the generating row equal 1.

## Knot theory

Tait's motivation for studying the ménage problem came from trying to find a complete listing of mathematical knots with a given number of crossings, say n. In Dowker notation for knot diagrams, an early form of which was used by Tait, the 2n points where a knot crosses itself, in consecutive order along the knot, are labeled with the 2n numbers from 1 to 2n. In a reduced diagram, the two labels at a crossing cannot be consecutive, so the set of pairs of labels at each crossing, used in Dowker notation to represent the knot, can be interpreted as a perfect matching in a graph that has a vertex for every number in the range from 1 to 2n and an edge between every pair of numbers that has different parity and are non-consecutive modulo 2n. This graph is formed by removing a Hamiltonian cycle (connecting consecutive numbers) from a complete bipartite graph (connecting all pairs of numbers with different parity), and so it has a number of matchings equal to a ménage number. For alternating knots, this matching is enough to describe the knot diagram itself; for other knots, an additional positive or negative sign needs to be specified for each crossing pair to determine which of the two strands of the crossing lies above the other strand.

However, the knot listing problem has some additional symmetries not present in the ménage problem: one obtains different Dowker notations for the same knot diagram if one begins the labeling at a different crossing point, and these different notations should all be counted as representing the same diagram. For this reason, two matchings that differ from each other by a cyclic permutation should be treated as equivalent and counted only once. Gilbert (1956) solved this modified enumeration problem, showing that the number of different matchings is

1, 2, 5, 20, 87, 616, 4843, 44128, 444621, ... (sequence A002484 in the OEIS).