ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P(2n+1,1)P(2n+1,1) be the generalised Petersen graph, with n≥4n\geq 4. A matching is a set of pairwise vertex-disjoint edges of the graph. Maximum-size matching conjecture. Any matching in P(2n+1,1)P(2n+1,1) has size at most n+1n+1. The conjecture follows from observations for P(3,1)P(3,1), P(5,1)P(5,1) and P(7,1)P(7,1) that, up to switching isomorphism, no matchings of the corresponding larger sizes occur; the assertion for all n≥4n\geq 4 remains open.

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.