Wang–Qin–Xia's stability conjecture for nontrivial graph pairs
Statement
Let be a nontrivial graph pair, meaning that and are coprime connected twin-free graphs and exactly one of them is bipartite. Assume that the graphs have no loops and that is bipartite. Wang–Qin–Xia's conjecture. The pair is stable if and only if is stable. This conjecture asks when stability of a nontrivial graph pair reduces to stability of its non-bipartite factor; the supplied source gives no resolution, so the conjecture 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.