3 problems

Polynomial hitting-number conjecture. The quantity $h(M)$ is bounded by a polynomial in $r$.

Huang–Sudakov's conjecture. For each integer $k>0$, there exists a graph $G$ with biclique partition number $k$ and chromatic number at least

Encoding conjecture.