The maximum-size matching conjecture for odd generalised Petersen graphs
Statement
Let be the generalised Petersen graph, with . A matching is a set of pairwise vertex-disjoint edges of the graph. Maximum-size matching conjecture. Any matching in has size at most . The conjecture follows from observations for , and that, up to switching isomorphism, no matchings of the corresponding larger sizes occur; the assertion for all 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.