ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be an odd prime, let K2pK_{2p} be the complete graph on 2p2p circularly ordered vertices, and let LL be a list of pp positive integers less than pp. A perfect matching FF of K2pK_{2p} is a set of pp pairwise disjoint edges covering all vertices, and ℓ(F)\ell(F) denotes its list of edge-lengths. Prime-order even-list conjecture. There exists a perfect matching FF of K2pK_{2p} such that ℓ(F)=L\ell(F)=L if and only if the number of even integers in LL is even. This addresses the even case of the seating couple problem under the stronger assumption that the number of couples is an odd prime. The paper presents it as an open conjecture motivated by necessary conditions and computational evidence.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.