ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a bridgeless cubic graph, let a∈E(G)a\in E(G), and let i∈{0,1,2}i\in\{0,1,2\}. For a list of perfect matchings, define νG[a:M1,M2,M3]\nu_G[a:M_1,M_2,M_3] to be the number of those matchings containing aa. Frequency formulation of the Fan–Raspaud conjecture. There exist three perfect matchings M1,M2,M3M_1,M_2,M_3 such that M1∩M2∩M3=∅M_1\cap M_2\cap M_3=\emptyset and νG[a:M1,M2,M3]=i\nu_G[a:M_1,M_2,M_3]=i.

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 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.