An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,t}\) (Q1969798)

This paper considers the problem of determining the maximum number of edges of a graph of order \(n\) that contains neither \(K_t\) nor \(K_{t,t}\) as a subgraph, where \(t\) and \(n\) are positive integers with \(n\geq t\geq 2\). The author has solved this problem for \(n= 2t+1\) in this paper. This problem is solved by Turán's theorem for \(n< 2t\), and for \(n= 2t\) it has been solved by \textit{R. A. Brualdi} and \textit{S. Mellendorf} [Electron. J. Comb. 1, R2 (1994; Zbl 0810.05041)].