ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let mathcalGmathcal G be a finite abelian group, let D(mathcalG)D(mathcal G) denote its Davenport constant, and let GG be a graph. A graph is zero-forcing for mathcalGmathcal G if every mathcalGmathcal G-labeling of its vertices has a non-empty connected zero-sum subgraph. Zero-forcing chromatic conjecture. If

χ(G)≥D(G),\chi(G) \geq D(\mathcal G),

then GG is zero-forcing for mathcalGmathcal G. This would follow from Hadwiger's conjecture and would give a sufficient condition depending on the Davenport constant rather than the order of the group; it 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.