Pasotti–Pellegrini's odd-order near-factor conjecture
Statement
Let be the complete graph on vertices, where is odd, and define edge-length by
A near -factor is a spanning subgraph of with one isolated vertex and a matching on the remaining vertices. Let be a list of positive integers not exceeding , and call it admissible when, for every divisor of , the number of multiples of appearing in is at most .
Pasotti–Pellegrini conjecture. There exists a near -factor of with if and only if 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.