ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KvK_v be the complete graph on vv vertices, where v=2n+1v=2n+1 is odd, and define edge-length by

ℓ(x,y)=min⁡(∣x−y∣,v−∣x−y∣).\ell(x,y)=\min(|x-y|,v-|x-y|).

A near 11-factor FF is a spanning subgraph of KvK_v with one isolated vertex and a matching on the remaining vertices. Let LL be a list of nn positive integers not exceeding nn, and call it admissible when, for every divisor dd of vv, the number of multiples of dd appearing in LL is at most v−d2\frac{v-d}{2}.

Pasotti–Pellegrini conjecture. There exists a near 11-factor FF of KvK_v with ℓ(F)=L\ell(F)=L if and only if LL is admissible.

The source reports partial results but states that this conjecture remains widely open. It generalizes Meszka's problem from prime order to arbitrary odd order.

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.