ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph GG is Z3\mathbb{Z}_3-flow-critical if it is flow-critical with respect to nowhere-zero Z3\mathbb{Z}_3-flows, as defined in the source. Density conjecture for Z3\mathbb{Z}_3-flow-critical graphs. Every Z3\mathbb{Z}_3-flow-critical graph GG satisfies

∣E(G)∣≤3∣V(G)∣−5.|E(G)|\leq 3|V(G)|-5.

Moreover, if ∣V(G)∣≥7|V(G)|\geq 7, then

∣E(G)∣≤3∣V(G)∣−8.|E(G)|\leq 3|V(G)|-8.

This conjecture concerns the extremal density of nonplanar Z3\mathbb{Z}_3-flow-critical graphs. The stated examples K3,n−3+K_{3,n-3}^+ 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 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.