3 problems

Let $\operatorname{ex}(n,K_{4,6})$ be the maximum number of edges in an $n$-vertex graph containing no copy of $K_{4,6}$. $K_{4,6}$ extremal-number conjecture. … The conjecture ref…

Let $\operatorname{NG}(q,4)$ be the projective norm graph over the parameter $q$, and let $K_{4,6}$ be the complete bipartite graph with parts of sizes $4$ and $6$. $K_{4,6}$ count…

Higher-wise independence conjecture. For any prime power $q$ and integers $4\leq\ell<t$, all but $o(n^\ell)$ sets of $\ell$ vertices in $\operatorname{NG}(q,t)$ have…