For fixed integers $s\ge t\ge2$, let $\operatorname{ex}(n,n,n,K_{s,t})$ denote the maximum number of edges in a tripartite $K_{s,t}$-free graph with $n$ vertices in each part. When $s\ge(t-1)!+1$, let $r$ be the largest integer satisfying $s\ge(t-1)!r^{t-1}+1$. Using the quotient norm graphs of Alon, R\'onyai and Szab\...
Yan-Tao Tang, Yi Zhao· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.