Mkrtchyan–Petrosyan–Zerafa frequency formulation of the Fan–Raspaud conjecture
Statement
Let be a bridgeless cubic graph, let , and let . For a list of perfect matchings, define to be the number of those matchings containing . Frequency formulation of the Fan–Raspaud conjecture. There exist three perfect matchings such that and .
The paper states that this formulation is equivalent to the Fan–Raspaud conjecture. Its status is therefore the same unresolved status in the supplied source.
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.