The zero-forcing consequence of the minimal-forts bound

Let $G$ be a graph, let $n$ be its order, and let $\mathcal{F}_G$ denote the family of minimal forts of $G$. Let $\operatorname{Z}(G)$ denote the zero forcing number of $G$. Zero-forcing consequence conjecture. If

$$\lvert\mathcal{F}_G\rvert = n/3,$$

then

$$\operatorname{Z}(G)=n/3.$$

The paper presents this as an observation supported by examples and by a proposition relating minimal forts, fort number, and zero forcing number; no general proof or resolution is supplied.