2 problems

For all positive integers $m,n$, the second-order Zarankiewicz number equals the recursive-line quantity: $z_2(m,n)=z_{RL}(m,n)$.

For every finite simple graph $G$, the semidefinite-hierarchy bound satisfies $\vartheta^{(\alpha(G)-1)}(G)=\alpha(G)$, where $\alpha(G)$ is the stability number of $G$.