An extremal problem concerning graphs not containing Kt and Kt,n−t Original Research Article

We consider the following problem as a generalization of that solved by Tura´nʹs theorem. Let t and n be positive integers with n⩾t⩾2. Determine the maximum number of edges of a graph of order n that contains neither Kt nor Kt,n−t as a subgraph. For n=2t, it is solved by . We solve it for n=2t + 1.