The prime-order even-list conjecture for perfect matchings
Statement
Let be an odd prime, let be the complete graph on circularly ordered vertices, and let be a list of positive integers less than . A perfect matching of is a set of pairwise disjoint edges covering all vertices, and denotes its list of edge-lengths. Prime-order even-list conjecture. There exists a perfect matching of such that if and only if the number of even integers in 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.