NP-completeness conjecture for graph balanceability
Statement
Let be a graph. A graph is balanceable if it admits a balanced signing, namely an assignment of signs to its edges such that every cycle has equally many positive and negative edges. Balanceability NP-completeness conjecture. The problem of deciding whether a given graph is balanceable is NP-complete. The conjecture concerns the computational complexity of balanceability; the preceding discussion identifies exact-half cut and induced-subgraph approaches as seemingly difficult, while the classification of circulant graphs between balanceable and non-balanceable remains an open problem.
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.