Generalized Turán Problems for Complete Bipartite Graphs

For graphs H, F and integer n, the generalized Turán number ex(n, H, F) denotes the maximum number of copies of H that an F-free n-vertex graph can have. We study this parameter when both H and F are complete bipartite graphs.


Introduction
The most basic question in extremal graph theory is the following: given a forbidden graph F, how many edges can an n-vertex graph have, if it does not contain F as a subgraph? A natural generalization is if instead of the number of edges, we are interested in the number of copies of another graph H. After several sporadic results (see e.g. [18,30]), the systematic study of this variant (usually referred to as the generalized Turán problem) was initiated by Alon and Shikhelman [1]. Since then, it has attracted the attention of several researchers, see e.g. [3,9,11,14,23].
We denote by exðn; FÞ the largest number of edges that an n-vertex F-free graph can have, the ordinary Turán number. For two graphs H and G, let N ðH; GÞ denote the number of (not necessarily induced) subgraphs of G that are isomorphic to H, in other words the number of (unlabeled) copies of H in G. Let exðn; H; FÞ :¼ maxfN ðH; GÞ : G is an n-vertex F-free graphg, i.e. exðn; H; FÞ is the largest number of copies of H that an n-vertex F-free graph can have.
In this paper we study the generalized Turán problem when both graphs F and H are complete bipartite. A number of papers have already studied exðn; K a;b ; K s;t Þ for different values of the parameters. Let us start with recalling what is known about the ordinary Turán number exðn; K s;t Þ ¼ exðn; K 1;1 ; K s;t Þ. We will assume without loss of generality that s t.
Extended author information available on the last page of the article In the case s ¼ 1, the problem is trivial. Let us say that a graph G on n vertices is almost d-regular, if either every vertex has degree d, or n À 1 vertices have degree d and one vertex has degree d À 1. It is easy to see that exðn; K 1;t Þ ¼ bðt À 1Þn=2c, with equality for any almost ðt À 1Þ-regular graph.
In the case s ¼ 2, the problem is much more complicated, and exact results are known only for some values of n in the case t ¼ 2. However, the asymptotics are known: exðn; K 2;t Þ ¼ 1 The upper bound comes from the general upper bound by Kővári et al. [20], that we will discuss shortly. The lower bound is by a construction of Füredi [6]. It is an algebraic construction that we will not describe in detail, but we will use it later. We will only use one of its well-known properties (besides it being K 2;t -free): all but oðn 2 Þ pairs of vertices have exactly t À 1 common neighbors.
Kővári et al. [20] showed that exðn; K s;t Þ ¼ Oðn 2À1=s Þ. It is generally conjectured to be the correct order of magnitude. Besides the above mentioned cases, it is only known if t ! ðs À 1Þ! þ 1. This was shown in [2,19], using the so-called projective norm graphs. Another construction in the case t is even larger compared to s, is due to Bukh [5], using random polynomials.
The order of magnitude of exðn; K a;b ; K s;t Þ was studied by Alon and Shikhelman [1] in the case a s t and a b\t. Their results were extended by Ma et al. [23] in the case a\s, b s and t is large enough and by Bayer et al. [3] in the case a 3, s ! 4, a b\t and t is large enough. Gerbner et al. [12] studied the case a; s b t. Gerbner [9] determined exðn; K 1;b ; K 2;2 Þ exactly.
We state a simple upper bound from [12] that we use later multiple times.
For sake of completeness, we sketch the proof. First, we can pick s vertices in n s ways. Those have at most t À 1 common neighbors, we pick a of them in at most t À 1 a ways. Those a vertices have at most t À 1 common neighbors, we have already picked s of them, now we pick b À s more in at most t À 1 À s b À s ways. We counted every copy of K a;b exactly b s ways. [11]) If for two graphs F and H the inequality jEðFÞj [ jEðHÞj holds, then we have exðn; H; FÞ ¼ Xðn jV ðHÞjÀ jEðHÞjðjV ðFÞjÀ2Þ jEðFÞjÀjEðH Þj Þ.
The above theorem does not fit into our setting, since cliques are counted rather than complete bipartite graphs. However, it clearly implies the same lower bound if we count any K a;b with a þ b m. In fact, in some cases this gives the best known lower bound even if the forbidden graph is K s;t with 2 s t.
We now define some notation that we use throughout the paper. Let G þ H denote the vertex disjoint union of G and H, and kG denote the vertex disjoint union of k copies of G. We say that a graph G is an extremal graph for exðn; H; FÞ if G has n vertices, is F-free and contains exðn; H; FÞ copies of H. If n, H and F are clear from the context, we just say that G is extremal. Let K a;b denote the graph we obtain from K a;b by adding all the edges in the partite set of size a. Equivalently, it has a vertices connected to every other vertex, and b vertices with no further edges.
Our paper contains several new results and surveys many old ones. We present all results according to the relationship of the four parameters, a, b, s, t. We always assume without loss of generality that a b and s t. The case a\s is considered in Sect. 2 and is divided into several subsections, depending on the relationship of b, s, and t. We summarize our findings in the following theorem. The proofs will appear in different subsections.
Let us elaborate on the conditions of the seven statements of the following theorem. Part (i) contains the weakest assumption for which we can determine the order of magnitude of exðn; K a;b ; K s;t Þ. The somewhat stronger condition of part (ii) enables to determine the asymptotics of exðn; K a;b ; K s;t Þ. Part (iii) is again a little less general than part (ii), but of its condition holds, then we can establish a stability result on exðn; K a;b ; K s;t Þ. Part (iv) keeps the condition of part (iii) on the relationship of a, b, s, t apart from requiring a ! 2, but focuses on the special case s ¼ a þ 1 and characterizes the cases when K a;nÀa is the extremal graph and gives the order of magnitude of the 'extra copies of K a;b ' in the other cases. Part (v) then gives a stronger stability in the complementing s [ a þ 1 cases with the condition of part (iii). Part (vi), similarly to part (iv), characterizes the relationship of a, b, s, t under the assumptions of part (v) that ensures K sÀ1;nÀsþ1 to be extremal. Finally, part (vii) addresses the case a ¼ 1.
(iii) If a\s t\b, then there exists n 0 ¼ n 0 ða; b; s; tÞ such that if n ! n 0 , then every extremal K s;t -free n-vertex graph, i.e. a graph with the most copies of K a;b , contains K sÀ1;nÀsþ1 . Moreover, if an n-vertex K s;t -free graph does not contain K sÀ1;nÀsþ1 , then it has at most exðn; K a;b ; K s;t Þ À Xðn bÀ1 Þ copies of K a;b . (iv) Let 2 a\t\b and n large enough. We have exðn; K a;b ; K aþ1;t Þ ¼ N ðK a;b ; K a;nÀa Þ þ HðnÞ if b\a þ t and at least one of the following assumptions hold.
(v) If a þ 1\s t\b and n is large enough, then every extremal n-vertex K s;tfree graph contains K sÀ1;nÀsþ1 . Moreover, if an n-vertex K s;t -free graph does not contain K sÀ1;nÀsþ1 , then it has at most exðn; K a;b ; K s;t Þ À Xðn bÀ1 Þ copies of K a;b . (vi) Let a þ 1\s t\b and n is large enough. If a þ b ! s þ t, then exðn; K a;b ; K s;t Þ ¼ N ðK a;b ; K sÀ1;nÀsþ1 Þ. If a þ b\s þ t, then exðn; K a;b ; K s;t Þ ¼ N ðK a;b ; K sÀ1;nÀsþ1 Þ þ HðnÞ. (vii) Let G 1 be a graph obtained from K sÀ1;nÀsþ1 by adding an ðt À 1Þ-regular graph of girth at least 5 to the n À s þ 1 vertices forming an independent set. Then if s t\b and n is large enough, then exðn; In Sect. 3, we briefly consider the case a ¼ s. In Sect. 4, we study the case a [ s, prove some upper bounds and obtain lower bounds by constructions derived from known constructions for Turán problems for Berge hypergraphs (the definitions will be introduced in Sect. 4). The following theorem contains our results.
Þ, while for any a\t and n we have exðn; K a;a ; K 1;t Þ n 2a t À 1 a t À 1 a À 1 . In particular, if 2t À 2 divides n, we have exðn; K a;b ;   In this case, it is easy to determine the order of magnitude of exðn; K a;b ; K s;t Þ.
Proof of Theorem 1.5 (i) The lower bound is given by K sÀ1;nÀsþ1 , which contains Hðn b Þ, more precisely, n À s þ 1 b s À 1 a copies of K a;b . For the upper bound, observe that if we choose in a K s;t -free graph a b-set, its vertices have at most t À 1 common neighbors. Therefore, exðn; K a;b ; K s;t Þ t À 1 a n b . h We can extend this result to determine the asymptotics of exðn; K a;b ; K s;t Þ in the case s\b.
Proof of Theorem 1.5 (ii) The lower bound is again given by K sÀ1;nÀsþ1 . For the upper bound, let G be a K s;t -free graph on n vertices, and choose a b-set B of vertices in G. If t b, then those b vertices have at most s À 1 common neighbors, thus there are at most s À 1 a copies of K a;b containing B as the larger partite set, finishing the proof. If t [ b, then B might be the larger partite set of several copies of K a;b . However, G contains Oðn s Þ copies of K s;b by Proposition 1.1. This means that Oðn s Þ b-sets have at least s common neighbors in G, let B be the family of such b-sets. Let B 0 denote the family of the other ð1 À oð1ÞÞ n b b-sets of vertices in G. Observe that vertices in a b-set in B have at most t À 1 common neighbors. Therefore, we have at most t À 1 b jBj ¼ Oðn s Þ copies of K a;b with the larger partite set in B, and at most ð1 À oð1ÞÞ s À 1 a n b copies of K a;b with the larger partite set in B 0 , finishing the proof. h In the remaining case a\s ¼ b\t, the asymptotic result does not necessarily hold. If a ¼ 1 and b ¼ 2, K 1;nÀ1 contains n À 1 2 copies of K 1;2 . However, Gerbner and Palmer [11] showed that in this case the Füredi graph gives the asymptotics, i.e. exðn; K 1;2 ; K 2;t Þ ¼ ð1 þ oð1ÞÞ tÀ1 2 n 2 . For other values of b ¼ s in the case a ¼ 1, recall that if t ! ðs À 1Þ! þ 1, the projective norm graphs [2,19] are K s;t -free with ð1 þ oð1ÞÞ 1 2 n 2À1=s edges. As projective norm graphs are close to regular, this shows that they contain ð1 þ oð1ÞÞn s =s! copies of K 1;b , just like K sÀ1;nÀsþ1 . This suggests that the asymptotic result might hold in the case In the case s b, we still have two possibilities: either b t, or t\b. We will be able to improve the above proposition by partially describing the structure of the extremal graphs and obtaining exact results in the case b is large compared to t.

a < s, t < b
We start by proving Theorem 1.5 (iii) which we restate for convenience. Theorem 1.5 (iii) If a\s t\b, then there exists n 0 ¼ n 0 ða; b; s; tÞ such that if n ! n 0 , then every extremal K s;t -free n-vertex graph, i.e. a graph with the most copies of K a;b , contains K sÀ1;nÀsþ1 . Moreover, if an n-vertex K s;t -free graph does not contain K sÀ1;nÀsþ1 , then it has at most exðn; K a;b ; K s;t Þ À Xðn bÀ1 Þ copies of K a;b .
Proof Recall that the already proven part (ii) of Theorem 1.5 shows that exðn; K a;b ; K s;t Þ ¼ ð1 þ oð1ÞÞN ðK a;b ; K sÀ1;nÀsþ1 Þ. Let us also recall its proof for the present case t b: in a K s;t -free graph G on n vertices, each of the n b different b-sets of vertices has at most s À 1 common neighbors, thus it forms the larger partite set in at most s À 1 a copies of K a;b .
For a subset S of vertices, we denote by N G ðSÞ the set of its common neighbors in Let S 1 ; S 2 ; . . .; S ' be the ðs À 1Þ-subsets of vertices of G with jN G ðS i Þj ! b and let us write . The following simple claim will be crucial to the proof.
Claim 2.1 Let B be a b-set of vertices such that t jN i \ Bj\b holds for some i ¼ 1; 2; . . .; '. Then B is G-bad. Furthermore, jN i \ N j j\t for any i 6 ¼ j and the Proof of Claim Suppose to the contrary that B is G-good and thus, by definition, there exists j such that N G ðBÞ ¼ S j . As jN i \ Bj\b implies B 6 N i , we obtain that contains a copy of K s;t . This contradicts the assumption that G is K s;t -free. This contradiction proves the first statement of the claim. If jN i \ N j j ! t, then any b-subset B of N i that contains at least t elements of N i \ N j and at least one element of N i n N j contradicts the already proven part of the claim.
Finally, let us count the pairs (M, B), where M ¼ N i for some i, B is a b-set and jB \ M j ¼ t. On the one hand, the number of such pairs is exactly On the other hand, by the already proven part of the claim, the b-set B in all such pairs must be G-bad, and for every G-bad B and t-subset T of B, there can be at most one With Claim 2.1 in hand, we are ready to prove the theorem. We distinguish three cases according to m ¼ maxfm i : i ¼ 1; 2; . . .; 'g.
CASE I m\ n 2 . By Claim 2.1 and the observation before the claim, we obtain that the number of The holds for all i with some C [ 0 depending only on b and t. As a consequence, the number of G-good b- CASE II n 2 \m\n À C Ã for a suitably chosen C Ã . If jN i j ¼ m, then by Claim 2.1, all b-sets B not contained in N i but meeting N i in at least t points are G-bad. Their number is at least m b À 1 ðn À mÞ ! an bÀ1 . This yields N ðK a;b ; GÞ\N ðK a;b ; K sÀ1;nÀsþ1 Þ À Xðn bÀ1 Þ. Thus, in all the above cases, N ðK a;b ; GÞ\exðn; K a;b ; K s;t Þ À Xðn bÀ1 Þ. This shows that we can find the extremal graph in the only remaining case, m ¼ n À s þ 1, thus G contains K sÀ1;nÀsþ1 : h With the stability result of part (iii) of Theorem 1.5 in hand, we are ready to prove (iv) which we restate here. Theorem 1.5 (iv) Let 2 a\t\b and n large enough. We have exðn; K a;b ; K aþ1;t Þ ¼ N ðK a;b ; K a;nÀa Þ þ HðnÞ if b\a þ t and at least one of the following assumptions hold.
Proof Let G be a K aþ1;t -free graph on n vertices that contains the most copies of K a;b . By part (iii) of Theorem 1.5, G contains K a;nÀa with partite sets A of order a and B of order n À a. Observe that for a copy K of K a;b , the partite set A (and similarly the partite set B) intersects K in a set of vertices that induces either a complete bipartite graph or an independent set in K. Let us assume that K is not a subgraph of this K a;nÀa , then the intersection of K and B is not an independent set. Let K[A] denote the intersection of A and K, more precisely K[A] denotes the subgraph of K induced on the vertices A \ V ðKÞ, and we define K[B] analogously. Let p q denote the orders of the partite sets of K[A]. Then K[B] is either K aÀp;bÀq or K aÀq;bÀp . Note that p ¼ 0 is possible and means that K[A] is an independent set in K.
Observe that a vertex v has degree at most t À 1 in G 0 because otherwise A [ fvg and neighbors of v would form a copy of K aþ1;t . This means that G 0 is K 1;t -free (and in particular both partite sets of K[B] have order less than t). K[B] is a complete bipartite graph K p 0 ;q 0 with p 0 a, q 0 b, and by the above observation we have p 0 ; q 0 \t. We also have p 0 [ 0 since K[B] is not an independent set. Therefore, we can apply Proposition 1.1 to show that exðjBj; K p 0 ;q 0 ; K 1;t Þ ¼ OðnÞ, thus there are O(n) copies of K p 0 ;q 0 for every p 0 and q 0 in G 0 . As they can be extended to copies of K a;b from A in constant many ways, we are done with the proof of the upper bound N ðK a;b ; GÞ N ðK a;b ; K a;nÀa Þ þ OðnÞ.
Let us show the stronger upper bound N ðK a;b ; GÞ N ðK a;b ; K a;nÀa Þ in the case b ! a þ t. Then we have b À q ! t and b À p ! t, thus one partite set of K[B] has order at least t, a contradiction.
Let us assume that b\a þ t and show the lower bounds first. In the case b 2a or 2a\t, we can embed b nÀa b c copies of K a;bÀa into B vertex-disjointly without creating K aþ1;t . Indeed, a complete bipartite graph can intersect at most one of these copies, and additionally use vertices of A. Thus K is a subgraph of either K 2a;bÀa or K a;b . The second graph does not contain K aþ1;t , and the first one contains it only if either b À a ! t (which contradicts our assumption b\a þ t) or 2a ! t and b À a ! a þ 1.
The assumption b 2a implies that b À a a\a þ 1.
Assume now that a þ b\2t À 1 and we will also use that a [ b tÀ1 2 c (otherwise the previous construction gives the desired lower bound). Then we let r ¼ b tÀ1 2 c and r 0 ¼ d tÀ1 2 e. We embed K aÀr;r 0 into A and b nÀa b c vertex disjoint copies of K r;bÀr 0 into B. Any copy of K aþ1;t in the resulting graph intersects A and B both in complete bipartite graphs and in particular is a subgraph of either K a;b or K rþr 0 ;aþbÀrÀr 0. Clearly K a;b does not contain K aþ1;t , and both partite sets of K rþr 0 ;aþbÀrÀr 0 have order less than t, a contradiction.
Let us show now the stronger upper bound N ðK a;b ; GÞ N ðK a;b ; K a;nÀa Þ in the remaining cases, i.e. t 2a\b and a þ b ! 2t À 1. Consider first the case p ¼ 0. Then K[B] either contains a partite set of order a or a partite set of order b, but this second possibility contradicts our earlier observation that both parts of K[B] have order less than t. Thus we can assume that K[B] contains K a;bÀa . Then a copy of K a;bÀa in B extends to K 2a;bÀa with the vertices of A. We have b À a [ a and 2a ! t, thus K aþ1;t is a subgraph of G.
Consider now the case p [ 0 and still we have , so K aþ1;bÀp and G contains K aþ1;t . This contradiction finishes the proof in this case. In particular, if p ¼ q, then we are done, thus we can assume that p\q. h Observe that if s [ a þ 1, then K sÀ1;nÀsþ1 is not the extremal graph. Recall that K a;b denotes the graph we obtain from K a;b by adding all the edges in the partite set of size a. With a slight abuse of notation, we still use the expression "partite set" for the partite sets of the original K a;b . The graph K sÀ1;nÀsþ1 is K s;t -free, as it has only s À 1 vertices of degree at least t. On the other hand, if we take a vertices from the part of size s À 1 to form an a-set, one more vertex from that part and b À 1 vertices from the other part to form a b-set, then they are the partite sets of a K a;b that is not present in K sÀ1;nÀsþ1 . We restate and prove Theorem 1.5 (v).
If a þ 1\s t\b and n is large enough, then every extremal nvertex K s;t -free graph contains K sÀ1;nÀsþ1 . Moreover, if an n-vertex K s;t -free graph does not contain K sÀ1;nÀsþ1 , then it has at most exðn; K a;b ; K s;t Þ À Xðn bÀ1 Þ copies of K a;b .
Proof Let u and v be vertices in the smaller partite set in K sÀ1;nÀsþ1 . We consider first the number of copies of K a;b containing the edge uv. We can take a À 1 other vertices from the smaller partite set and b À 1 vertices from the larger partite set to form a K a;b with them, thus there are Xðn bÀ1 Þ such copies of K a;b .
Let G be an extremal K s;t -free graph on n vertices, then by Theorem 1.5 (iii), G contains a copy of K sÀ1;nÀsþ1 . Let G 0 be the subgraph of G on the larger partite set. The maximum degree is at most t À 1 in G 0 because of the K s;t -free property. We consider the copies of K a;b that contain an edge inside the larger partite set. The subgraph of that K a;b inside the larger partite set is a complete bipartite graph K p;q for some p; q t À 1. By Proposition 1.1, the number of copies of K p;q in G 0 is O(n), since G 0 is a K 1;t -free graph. Each copy of K p;q can be extended to a copy of K a;b with vertices from the smaller partite set in constantly many ways.
Therefore, the total number of copies of K a;b containing an edge from the larger partite set is OðnÞ ¼ oðn bÀ1 Þ. If any edge is missing in G from the smaller partite set, we lose Xðn bÀ1 Þ copies of K a;b , thus G has less copies of K a;b than K sÀ1;nÀsþ1 , a contradiction. h It is easy to characterize the K s;t -free graphs containing K sÀ1;nÀsþ1 : they are those graphs G that have in the larger partite set a subgraph G 0 which does not contain any K p;q with p þ q ¼ t þ 1, p q [ t À s. Indeed, such a K p;q could be extended by adding s À p and t À q vertices from the smaller partite set of K sÀ1;nÀsþ1 to its partite sets, altogether s À p þ t À q ¼ s À 1 vertices. If, on the other hand, G contains a K s;t , it intersects the larger partite set in a complete bipartite graph K p 0 ;q with p 0 q. Then p 0 þ q ! t þ 1 and q ! t À s. Let p ¼ t þ 1 À q, then deleting p 0 þ q À t À 1 vertices from the partite set of K p 0 ;q of size p 0 we obtain K p;q with the desired properties. We are ready to restate and prove Theorem 1.5 (vi). Theorem 1.5 (vi) Let a þ 1\s t\b and n is large enough. If a þ b ! s þ t, then exðn; K a;b ; K s;t Þ ¼ N ðK a;b ; K sÀ1;nÀsþ1 Þ. If a þ b\s þ t, then exðn; K a;b ; K s;t Þ ¼ N ðK a;b ; K sÀ1;nÀsþ1 Þ þ HðnÞ.
Proof Let G be an extremal K s;t -free graph on n vertices. By Theorem 1.5 (v), G contains K sÀ1;nÀsþ1 with smaller part A and larger part B. Assume G contains a copy of K a;b that is not contained in K sÀ1;nÀsþ1 . This copy intersects B in a complete bipartite graph K p;q with p q. Then we have p þ q þ s À 1 ! a þ b, because these p þ q vertices can be extended with vertices from A to K a;b . Also we have p a.
We can add s À p vertices of A to the smaller partite set of K p;q and the remaining p À 1 vertices to the larger partite set to obtain a copy of K s;qþpÀ1 . If a þ b ! s þ t, then p þ q þ s À 1 ! a þ b ! s þ t and so p þ q À 1 ! t and thus K s;pþqÀ1 and so G contains K s;t . This contradiction finishes the proof of the first part of the statement.
Assume now that a þ b\s þ t. For the upper bound, let G 0 denote the subgraph of G inside the larger partite set. Observe that a vertex v has degree at most t À 1 in G 0 because otherwise the smaller partite set would extend v and its neighbors to K s;t . This means that G 0 is K 1;t -free. Every copy of K a;b that is not present in K sÀ1;nÀsþ1 intersects G 0 in a complete bipartite set K p;q with p a, q b. By Proposition 1.1, there are O(n) copies of K p;q for every p and q in G 0 . As they can be extended from A constant many ways, we are done with the upper bound.
For the lower bound, we pick p q arbitrarily with p þ q ¼ a þ b À s þ 1. We place bðn À s þ 1Þ=ðp þ qÞc vertex-disjoint copies of K p;q into the larger partite set B of a K sÀ1;nÀsþ1 . Any copy of K s;t in the resulting graph G 0 intersects this partite set in a complete bipartite graph on at least t þ 1 [ a þ b À s þ 1 vertices, which is impossible, thus G 0 is K s;t -free. In addition to the copies of K a;b in K sÀ1;nÀsþ1 , G 0 contains those copies that have one of the HðnÞ copies of K p;q from B, and from the set of s À 1 vertices of degree n À 1, a À p vertices are added to the smaller partite set and b À q ¼ p À a þ s À 1 vertices to the larger partite set, to form a K a;b . As a À p þ b À q ¼ s À 1, this is doable, finishing the proof. h Let G 0 be an almost ðt À 1Þ-regular graph on n À s þ 1 vertices with girth at least 5. It is well-known that such a G 0 exists if n À s þ 1 is large enough. G 0 obviously avoids any K p;q with p þ q ¼ t þ 1: it avoids K 1;t by the degree condition, and it avoids K 2;2 by the girth condition. Let us embed G 0 to K sÀ1;nÀsþ1 to obtain G 1 . As G 0 is not uniquely determined, neither is G 1 , but their degree sequence is, which in turn determines N ðK 1;b ; G 1 Þ. We end this subsection by restating and proving part (vii) of Theorem 1.5. (v), the extremal graph G contains a copy of K sÀ1;nÀsþ1 . The vertices of the larger part are connected to at most t À 1 other vertices of the larger part, thus have degree at most s þ t À 2. Moreover, if n À s þ 1 and t À 1 are both odd, than one of the vertices of the large part is connected to at most t À 2 other vertices of the larger part, thus has degree at most s þ t À 3. Therefore, G contains s À 1 vertices of degree at most n À 1, and depending on parity, either n À s þ 1 vertices of degree at most s þ t À 2, or n À s vertices of degree at most s þ t À 2 and one vertex of degree at most s þ t À 3. As G 1 has the same degree sequence with equality everywhere, we are done. h

a < s, b < s
In this case Alon and Shikhelman [1] showed the upper bound Oðn aþbÀab=s Þ. They also showed a matching lower bound in the case 1 a b\ðs þ 1Þ=2 and t ! ðs À 1Þ! þ 1. Ma et al. [23] extended their result with Theorem 1.2 by getting rid of the condition b\ðs þ 1Þ=2 at the cost of increasing t even further: if a\s, b\s and t is large enough, then exðn; K a;b ; K s;t Þ ¼ Hðn aþbÀab=s Þ.
Observe that we are in the case containing the ordinary Turán problem for K s;t , and indeed the results are similar too: the simple upper bound can be matched by a lower bound in the order of magnitude in the case t is large. In other cases, the best known lower bound on exðn; K s;t Þ is Xðn 2À 1 s À 1 t Þ by a simple random construction. Theorem 1.3 extends that construction to generalized Turán problems and gives exðn; K a;b ; K s;t Þ ¼ Xðn aþbÀ abðsþtÀ2Þ stÀab Þ.

a = s
In the case a ¼ s, we can again assume that b\t, as otherwise exðn; K a;b ; K s;t Þ ¼ 0.
The simple upper bound Oðn s Þ from Proposition 1.1 also holds in this case, and it is sharp if t is large enough by Theorem 1.2. If s ¼ 1, the problem is trivial, the almost ðt À 1Þ-regular graphs are the extremal graphs. In the case s ¼ 2, it is not hard to obtain an asymptotically sharp bound. We use the well-known Füredi graph [6] mentioned in the introduction. Recall that it is a K 2;t -free graph that gives the asymptotic of exðn; K 2;t Þ, and all but oðn 2 Þ pairs of vertices have exactly t À 1 common neighbors. Gerbner and Palmer [11] showed that among K 2;t -free graphs, the Füredi graph contains asymptotically the most copies of paths and cycles of any length, thus in particular the most copies of K 2;2 . We can extend this to K 2;b .
Proof Let G be a K 2;t -free graph on n vertices. We count the copies of K 2;b by picking the two vertices in the smaller part. This can be done n 2 ways, and then we pick b of their at most t À 1 common neighbors.
For the lower bound, observe that in the Füredi graph each of the ð1 À oð1ÞÞ n 2 pairs that have exactly t À 1 common neighbors forms the smaller part of t À 1 b Bayer et al. [3] showed exðn; K 4;6 ; K 4;7 Þ ¼ Xðn 7=4 Þ. For other values of s, we again use Theorem 1.3. Here ab\st is always satisfied, and we have exðn; K a;b ; K s;t Þ ¼ Xðn aþbÀ abðsþtÀ2Þ stÀab Þ ¼ Xðn aþbÀ bðaþtÀ2Þ tÀb Þ. If t increases, the exponent goes to a.

a > s
In the case a [ s, we can assume that b\t, as otherwise exðn; K a;b ; K s;t Þ ¼ 0. Recall the simple upper bound Oðn s Þ from Proposition 1.1. We first consider the case s ¼ 1.
We start with restating and proving Theorem 1.6 (i).
Þ, while for any a\t and n we have exðn; K a;a ; K 1;t Þ n 2a t À 1 a t À 1 a À 1 . In particular, if 2t À 2 divides n, we have exðn; K a;b ; K 1;t Þ ¼ N ðK a;b ; n 2tÀ2 K tÀ1;tÀ1 Þ. Proof Let G be a K 1;t -free graph and v be a vertex of G. Let us count the number of copies of K a;b containing v. We start with those copies where v is in the part of size a.
We have to choose b neighbors of v, at most t À 1 b ways, and then a À 1 neighbors of those vertices, at most t À 1 a À 1 ways. If b 6 ¼ a, we need to add t À 1 a t À 1 b À 1 for the copies of K a;b that have v in the part of size b. In both cases, every copy of K a;b is counted a þ b times. Observe that in the graph n 2tÀ2 K tÀ1;tÀ1 , every vertex is in this many copies of K a;b , finishing the proof. h Let us discuss briefly the case 2t À 2 does not divide n. Assume that in the above proof, a vertex is contained in If on the other hand every vertex is contained in less copies of K a;b , and n is large enough compared to a, b, t, then G contains less copies of K a;b than b n 2tÀ2 cK tÀ1;tÀ1 , thus cannot be extremal. This shows that the extremal graph consists of vertex disjoint copies of K tÀ1;tÀ1 , and a subgraph of order c for some constant c that depends on a, b and t.
We show how to improve this with a more involved calculation in some cases, to obtain exact results. For simplicity, we will deal only with the case a ¼ b. In the case t\4, the only meaningful case is t ¼ 3, a ¼ 2, which is trivial, as every copy of K 2;2 is a connected component in a K 1;3 -free graph. We restate and prove Theorem 1.6 (ii).
Proof Let us assume t ! 4. A simple calculation shows that , which we will use later. We deal first with the case n\2t À 2. Consider a K 1;t -free graph G. Let us delete the edges of G that are not contained in any copy of K a;a . We claim that the resulting graph is K 3 -free. Indeed, a triangle xyz would mean that there is a K a;a with partite sets X and Y, x 2 X , y 2 Y . Then without loss of generality, z is connected to at most t/2 vertices in X. The edge xz is also in a K a;a , where z is in a partite set Z and x is in a partite set X 0 . Then at least a À t=2 À ðn À 2aÞ elements of X 0 are in Y, as they are all connected to z. This shows that x is connected to those vertices plus the vertices of Z, thus, using the assumption t 8a 7 þ 1, the degree of x is at least a þ a À t=2 À ðn À 2aÞ ! t, a contradiction.
It was shown by Győri et al. [18] that among K 3 -free graphs on n vertices, a complete bipartite graph contains the most copies of K a;b , and in particular K b n 2 c;d n 2 e contains the most copies of K a;a , finishing the proof in this case. Theorem 1.6 (i) deals with the case n ¼ 2t À 2, thus we can assume now n [ 2t À 2. Recall that in K tÀ1;tÀ1 , every vertex is contained in t À 1 a t À 2 a À 1 copies of K a;a Let G be a K 1;t -free graph on n vertices and v be one of its vertices. If v is contained in a K tÀ1;tÀ1 , then this is a connected component of G. Otherwise, there are two possibilities. One of them is that v has less than t À 1 neighbors, in which The other possibility is that v has a set P of t À 1 neighbors, but the vertices of P have at most t À 2 common neighbors. To pick a K a;a containing v, we need to pick a vertices from P ( t À 1 a ways), and then a of their common neighbors (including v). If any a-set has at most t À 2 common neighbors including v, then v is in at most t À 1 a t À 3 a À 1 \ t À 1 a t À 2 a À 1 =2 copies of K a;a .
If an a-set A & P has a set Q of t À 1 common neighbors (including v), then any other a-set A 0 & P has common neighbors only from Q, as A 0 intersects A in a vertex v 0 , and v 0 has at most t À 1 neighbors, i.e. only the vertices of Q. Therefore, the only way that vertices in P do not have t À 1 common neighbors is that at least one of the vertices of P is not connected to some vertex of Q. Therefore, v is contained in at In both cases, we obtained that every vertex that is not in a K tÀ1;tÀ1 is contained in at most half as many copies of K a;a as those vertices that are in a K tÀ1;tÀ1 . If there are at least m ! 2t À 2 vertices in connected components that are different from K tÀ1;tÀ1 , then we can delete them and add bm=ð2t À 2Þc copies of K tÀ1;tÀ1 to obtain more copies of K a;a . Therefore, we can assume that we have bn=ð2t À 2Þc copies of K tÀ1;tÀ1 in G, and the extremal graph on the remaining p vertices, finishing the proof. h We remark that with the same proof, one can obtain a similar bound for exðn; K a;b ; K s;t Þ if t is not much bigger than a. However, the additional small graph on the remaining p vertices might be unbalanced.
For larger s, we are unable to improve the upper bound. We can improve the trivial linear lower bound using Theorem 1.4, which yields exðn; For smaller values of t, Theorem 1.3 yields that if ab\st, then exðn; K a;b ; K s;t Þ ¼ Xðn aþbÀ abðsþtÀ2Þ stÀab Þ. Let us show now a connection to hypergraph Turán problems. A hypergraph G is a Berge copy of a graph G (in brief: a Berge-G) if its vertex set contains V(G), and there is a bijection between the edges of G and the hyperedges of G such that each edge is contained in its image. In other words, we can add additional vertices to the edges of G (arbitrarily) to obtain G.
Berge hypergraphs were introduced by Gerbner and Palmer [10], extending the well-established notion of hypergraph cycles due to Berge. A hypergraph is linear if any two of its hyperedges share at most one vertex. We say that a hypergraph has girth k if it is linear and its shortest Berge cycle has length k. Note that the linearity can be thought of as forbidding Berge cycles of length 2.
Proposition 4.1 Let 2\a b\t. Let H be an ða þ bÞ-uniform hypergraph of girth at least 5. Let G be a graph obtained by placing an arbitrary K a;b into every hyperedge of H. Then G is K 2;t -free.
Proof Assume indirectly that there is a copy K of K 2;t in G with partite sets fu; u 0 g and T. Observe that if an edge e of G is contained in a hyperedge h of H, then no other hyperedge of H contains e, hence e must be in the copy of K a;b embedded into h. Let v; v 0 be vertices of T. If the four edges uv; u 0 v; uv 0 ; u 0 v 0 are contained in four different hyperedges, those hyperedges form a Berge-C 4 , a contradiction. Otherwise there is a hyperedge h containing at least three of u; u 0 ; v; v 0 .
Assume first that h contains u; u 0 ; v. If there is a vertex v 00 2 T n h, then uv 00 and u 0 v 00 must come from hyperedges h 0 ; h 00 different from each other and from h because of the linearity, and then h; u; h 0 ; v 00 ; h 00 ; u 0 form a Berge triangle, a contradiction. If h contains T, then u; u 0 are in the same partite set of the K a;b embedded into h. Then a third vertex v 00 2 T is in the same partite set (as T does not fit into the other partite set), but then the edge uv 00 cannot be in G, a contradiction.
Assume now that h contains u; v; v 0 , but not u 0 . If the edges u 0 v and u 0 v 0 are in the same hyperedge h 0 , that contradicts the linearity. If u 0 v 2 h 0 and u 0 v 0 2 h 00 with h 0 6 ¼ h 00 , then h; v; h 0 ; u 0 ; h 00 ; v 0 is a Berge triangle, a contradiction finishing the proof. h By the above proposition, in the case 2 s\a b\t, we have that exðn; K a;b ; K s;t Þ is at least the largest size of an ða þ bÞ-uniform hypergraph H without Berge cycles of length at most 4. As hyperedges of H intersect in at most one vertex, it is easy to see that H has Oðn 2 Þ hyperedges, thus this lower bound is often much weaker than the previous ones. In fact, as Berge cycles of length 4 are forbidden, there are Oðn 3=2 Þ hyperedges in H due to a result of Győri and Lemons [17]. Lazebnik and Verstraëte [21] studied r-uniform hypergraphs without Berge cycles of length at most 4, and proved the bound Xðn 4=3 Þ. Timmons and Verstraëte [28] mention that this can be improved to n 3 2 Àoð1Þ using a construction of Ruzsa [25], thus we have the same lower bound for exðn; K a;b ; K s;t Þ if 2\a b\t. We obtained Theorem 1.6 (iii), which we restate as a corollary. In the rest of this section we describe further similar connections to hypergraph Turán problems. However, they do not improve the bounds we have obtained, due to the lack of results on the corresponding hypergraph Turán problems. Furthermore, we relate exðn; K a;b ; K s;t Þ to the size of some linear hypergraphs, thus we cannot hope for a superquadratic lower bound (recall that our upper bound is Oðn s Þ). Let H be an ða þ bÞ-uniform linear hypergraph that does not contain a Berge-K s;p . Let G be a graph obtained by placing an arbitrary K a;b into every hyperedge of H. Then G is K s;t -free.
Unfortunately, there are not many results on linear hypergraphs without Berge-K s;p . In the case s ¼ 2, Timmons [27] showed a construction with Xðn 3=2 Þ hyperedges for any uniformity (further results were obtained in [13] for uniformity 3). However, this does not improve the bounds obtained using Theorem 1.4.
Proof of Proposition 4.3 Assume there is a copy of K s;t in G with smaller partite set S and larger partite set T. First we show that the number of vertices of T that are contained in a hyperedge with more than one vertex of S is at most ða þ b À 2Þ s 2 .
Indeed, every 2-set in S is contained in at most one hyperedge of H, and that hyperedge contains a þ b À 2 other vertices. Let T 0 be an arbitrary set of ða þ b À 1Þ s p other vertices in T. Therefore, there is a K s;ðaþbÀ1Þ s p with partite sets S and T 0 , such that for every vertex of T 0 , the edges of this K s;ðaþbÀ1Þ s p incident with it each come from distinct hyperedges of H. Consider a u 2 S. At most a þ b À 1 vertices of T 0 are contained in the same hyperedge together with u. For each hyperedge, we keep only one such vertex, and delete the rest. This way we keep at least ða þ b À 1Þ sÀ1 p vertices from T 0 . We repeat this for every vertex of S, and at the end there are at least p vertices remaining. Therefore, we obtain a K s;p where each edge comes from a hyperedge that contains only one vertex from S and only one vertex from T. Those hyperedges form a Berge-K s;p , a contradiction. h We remark that the proof shows a bit more: we do not need to forbid every Berge-K s;p , only those where in the bijection defining the Berge-K s;p , the image of every edge uv contains only u and v from V ðK s;p Þ. In other words, we can add additional vertices that are not in V(G) to the edges of G to obtain G. Equivalently, the trace of a subhypergraph of H is exactly a K s;p on a set of s þ p vertices. Extremal problems for such hypergraphs have been studied, see e.g. [8], but we are not aware of any results in the linear setting.
We can say more at the cost of increasing t (not a big cost, as we did not make any effort to optimize the threshold on t). Let us define a third type of graph-based hypergraph. The r-uniform expansion G þr of a graph G is the Berge copy where for two edges e and e 0 of G, their images share only the one or zero vertex that e and e 0 share. In other words, we can add r À 2 additional vertices to the edges of G to obtain G, such that every new vertex is added only to one hyperedge. . Let G be a graph obtained by placing an arbitrary K a;b into every hyperedge of H. Then G is K s;t -free.
There are several extremal results concerning expansions, see [24] for a survey. However, much less is known in the linear setting.
Proof of Proposition 4.4 Assume there is a copy of K s;t in G with smaller partite set S ¼ fv 1 ; . . .; v s g and larger partite set T. First we show that the number of vertices of T that are contained in a hyperedge with more than one vertex of S is at most Indeed, every 2-set in S is contained in at most one hyperedge of H, and that hyperedge contains at most a þ b vertices. Let T 1 be an arbitrary set of ðp À 1Þsðs À 1Þða þ b À 2Þ 2 þ 1 other vertices in T. Therefore, there is a K s;ðpÀ1ÞsðsÀ1ÞðaþbÀ2Þ 2 þ1 with partite sets S and T 1 , such that for every vertex u 2 T 1 , the edges of this subgraph incident with u each come from distinct hyperedges of H. Let us pick an arbitrary hyperedge h containing v 1 and a vertex u 1 of T 1 (recall that v 1 2 S). Let w be another vertex of h. By the above, w 6 2 S. If w 2 T 1 , we delete it from T 1 . Otherwise, there are at most s À 1 hyperedges besides h that contain a vertex from S and contain w by the linearity of H. These s À 1 hyperedges contain at most ðs À 1Þða þ b À 2Þ vertices from T 1 ; we delete those vertices. This way altogether we deleted at most ðs À 1Þða þ b À 2Þ 2 vertices. Then we choose a hyperedge containing v 2 and u 1 , and repeat this procedure. After that we repeat it for v 3 and u 1 , and so on. At the end of this we have deleted at most sðs À 1Þða þ b À 2Þ 2 vertices of T 1 to obtain T 2 . Note that by the above procedure, the s hyperedges containing u 1 and v i for 1 i s are such that these hyperedges do not share any vertex with any hyperedge that contains a vertex from S and a vertex from T 2 . We pick another hyperedge containing v 1 and a vertex u 2 of T 2 and apply the same procedure, and so on. That is we obtain a subset T 3 of T 2 such that the hyperedges h i;2 containing v i and u 2 do not share any vertex with any hyperedge that contains a vertex from S and a vertex from T 3 . In general, we pick u j and then T jþ1 & T j such that that the hyperedges h i;j containing v i and u j do not share any vertex with any hyperedge that contains a vertex from S and a vertex from T jþ1 . As in each iteration, we delete at most sðs À 1Þða þ b À 2Þ 2 vertices, after picking u 1 ; . . .; u pÀ1 , we still have a last vertex u p to pick.
We are left with a copy K of K s;p in G, where one of the partite sets is S. Let us denote the other partite set by P. For each edge v i u j of K, if 1 j p À 1 and 1 i s, then we picked a hyperedge h i;j containing u i and v j . If i ¼ p, we pick the hyperedge containing u p and v i assured by the complete bipartite subgraph of G on S and T 1 . We claim that the hypergraph formed by these hyperedges is a K þðaþbÞ s;p , a contradiction. Indeed, if i ¼ i 0 or j ¼ j 0 , then, by linearity of H, h i;j \ h i 0 ;j 0 consists of u i or v j . Without loss of generality, we can assume j\j 0 . But then T jþ1 T j 0 was chosen such that the hyperedge h i;j do not share any vertex with any hyperedge that contains a vertex from S and a vertex from T jþ1 such as h i 0 ;j 0 . h

Concluding Remarks
In this paper we studied exðn; K a;b ; K s;t Þ for different values of the parameters, with varying success. We left wide open the question what happens if 1\s\a b\t. None of the upper and lower bounds we obtained seems to be close to the value of exðn; K a;b ; K s;t Þ in this case. In Sect. 2, Theorem 1.5 (iii) and (v) are stability results for some values of a, b, s, t. Very recently, Livinsky [22] observed that the K 2;tþ1 -free constructions of Füredi do not contain any K 3;3 . It is not hard to see that the construction with t ¼ ð1 þ oð1ÞÞn 1=3 contains ð1=2 þ oð1ÞÞ n 3 ¼ ð1=2 þ oð1ÞÞexðn; K 2;3 ; K 3;3 Þ copies of K 2;3 and its structure is very different from that of the extremal graphs. An obvious next step in future research is to consider complete r-partite graphs. Some of our results can be extended to this setting easily. Let us show one example, a generalization of Theorem 1.5 (i).
Proof The lower bound is given by any complete r-partite graph with one part of size s 1 À 1 and r À 1 parts of linear size. For the upper bound, observe that if we choose in a K s 1 ;...;s r -free graph a copy of the complete ðr À 1Þ-partite graph K a 2 ;...;a r , then its vertices have at most s r À 1 common neighbors. Therefore, the number of copies of K a 1 ;...;a r is at most s r À 1 a 1 times the number of copies of K a 2 ;...;a r , which is Hðn a 2 þa 3 þÁÁÁþa r Þ, finishing the proof. h However, the cases r ! 3 can be much more complicated and introduce new phenomena. In particular, let us consider the smallest such pair of graphs, K 1;1;1 ¼ K 3 and K 1;1;2 . One would think that this would be an easy problem and difficulties arise only for larger values of the parameters. This is far from the truth. Alon and Shikhelman [1] showed that for any t, exðn; K 1;1;1 ; K 1;1;t Þ ¼ oðn 2 Þ but exðn; K 1;1;1 ; K 1;1;t Þ ¼ n 2Àoð1Þ . Moreover, this is a reformulation of the celebrated Ruzsa-Szemerédi 6-3 theorem [26]. Gowers and Janzer [16] generalized this for any r. Let K denote the complete r-partite graph on r þ 1 vertices, i.e. K 1;1;...;1;2 . Then exðn; K r ; KÞ ¼ oðn rÀ1 Þ but exðn; K r ; KÞ ¼ n rÀ1Àoð1Þ .
A possible weakening is to forbid a subgraph of K s;t . Gerbner et al. [15] showed exðn; K 2;b ; C 2s Þ ¼ ð1 þ oð1ÞÞ s À 1 2 n b ¼ ð1 þ oð1ÞÞN ðK 2;b ; K sÀ1;nÀsþ1 Þ (the case b ¼ 2 was proved in [14]). This result is implied by Theorem 1.5 (ii) if b ! s, and is improved to an exact result by Theorem 1.5 (iv) if b [ s ¼ 3. Similarly, in the cases where the extremal construction is K sÀ1;nÀsþ1 , then the bounds we obtained for exðn; K a;b ; K s;t Þ also hold for exðn; K a;b ; FÞ for each bipartite graph F with the property that in any proper two-coloring of F, both color classes have order at least s and at most t.

Declarations
Conflict of interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/ licenses/by/4.0/.