The maximal number of induced complete bipartite graphs

Abstract The aim of this paper is to determine the maximal number of induced K(t, t) subgraphs in graphs of given order and in graphs of given size.

[1]  J. Moon,et al.  On cliques in graphs , 1965 .

[2]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[3]  L. Beineke,et al.  The Maximum Number of Strongly Connected Subtournaments* , 1965, Canadian Mathematical Bulletin.

[4]  J. Sheehan,et al.  On the number of complete subgraphs contained in certain graphs , 1981, J. Comb. Theory, Ser. B.