ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A signed graph (G,Σ)(G,\Sigma) consists of a graph GG and a set Σ⊆E(G)\Sigma\subseteq E(G) of negative edges. A signed circuit is either a balanced circuit, containing an even number of edges of Σ\Sigma, 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 66 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 kk-cover exist for every positive integer k≤5k\leq 5; the conjecture asserts that 66 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 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.