Forbidden subgraphs in the norm graph

We show that the norm graph with nn vertices about 12n2−1/t edges, which contains no copy of the complete bipartite graph Kt,(t−1)!+1Kt,(t−1)!+1, does not contain a copy of Kt+1,(t−1)!−1Kt+1,(t−1)!−1.