The zero forcing conjecture for Johnson graphs

Let $G_n=K(n,2)$ be the Johnson graph whose vertices are the $2$-subsets of an $n$-element set, with two vertices adjacent when the corresponding subsets intersect in one element. For an integer $q\geq 0$, let $Z_q(G_n)$ denote the $q$-zero forcing number of $G_n$. The zero forcing conjecture for $G_n$. For any $n\geq 8$,

$$Z_0(G_n)=\binom{n-1}{2}.$$

Moreover,

$$Z_0(G_n)=\binom{n}{2}-6\quad\text{for }n\in\{5,6,7\},$$

and

$$Z_0(G_n)=Z_1(G_n)\quad\text{for any }n\geq 7,$$

while

$$Z_1(G_n)=Z_0(G_n)+1\quad\text{for }n\in\{5,6\}.$$

These claims refine the preceding exact values and bounds for the zero forcing numbers of the Johnson graphs $K(n,2)$; the source does not report a resolution.