Cameron's fort-number lower-bound conjecture for maximum nullity

Let $G$ be a graph, let $\operatorname{ft}(G)$ be its fort number, let $\operatorname{Z}^*(G)$ be its fractional zero forcing number, and let $\operatorname{M}(G)$ be its maximum nullity.

Cameron's conjecture. For every graph $G$,

$$\operatorname{ft}(G)\leq \operatorname{Z}^*(G)\leq \operatorname{M}(G).$$

The first inequality is the known general fort-number bound for fractional zero forcing. The conjecture asserts the additional lower bound on maximum nullity; it is motivated by the established inequality $\operatorname{M}(G)\leq \operatorname{Z}(G)$ and the need for lower bounds on maximum nullity.