The density conjecture for \mathbb{Z}_3-flow-critical graphs
Statement
A graph is -flow-critical if it is flow-critical with respect to nowhere-zero -flows, as defined in the source. Density conjecture for -flow-critical graphs. Every -flow-critical graph satisfies
Moreover, if , then
This conjecture concerns the extremal density of nonplanar -flow-critical graphs. The stated examples attain the second bound, while the paper proves related upper bounds and establishes the conjecture in several cases; the general assertion 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.