Chromatic-number criterion for zero-forcing graphs
Statement
Let be a finite abelian group, let denote its Davenport constant, and let be a graph. A graph is zero-forcing for if every -labeling of its vertices has a non-empty connected zero-sum subgraph. Zero-forcing chromatic conjecture. If
then is zero-forcing for . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.