The 6-cover conjecture for flow-admissible signed graphs
Statement
A signed graph consists of a graph and a set of negative edges. A signed circuit is either a balanced circuit, containing an even number of edges of , or a barbell, consisting of two unbalanced circuits sharing exactly one vertex or two vertex-disjoint unbalanced circuits joined by a minimal path. The signed graph is flow-admissible if every edge belongs to a signed circuit.
6-cover conjecture. Every flow-admissible signed graph has a family of signed circuits such that every edge belongs to exactly members of the family.
This extends the circuit-cover problem from ordinary bridgeless graphs to signed graphs. It is known that flow-admissible signed graphs with no -cover exist for every positive integer ; the conjecture asserts that is sufficient, while its truth 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.