The maximal number of induced complete bipartite graphs

  title={The maximal number of induced complete bipartite graphs},
  author={B. Bollob{\'a}s and C. Nara and S. Tachibana},
  journal={Discret. Math.},
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. 

Topics from this paper

The chromatic uniqueness of complete bipartite graphs
  • Shaoji Xu
  • Computer Science, Mathematics
  • Discret. Math.
  • 1991
The conjecture raised in (1982) that K ( m, n ) is chromatically unique when m ⩽ n ⩾ 2 is proved, is proved using a theorem given in the first part. Expand
The number of 4-cycles in triangle-free oriented graphs
The maximum number of oriented 4-cycles possible in triangle-free oriented graphs is determined and the extremal graphs are characterized. Expand
The maximal number of inducedr-partite subgraphs
It is shown that ift > 1 + logr, then the maximal number of inducedKr(t)'s is achieved in the case of the Turán graphTr(n), and that this bound ont is essentially best possible. Expand
Bicliques in Graphs I: Bounds on Their Number
Those classes of graphs where the number of bicliques is polynomial in the vertex number are characterized, provided the class is closed under induced subgraphs. Expand
A bound on the inducibility of cycles
It is proved that every n -vertex graph has at most 2 n k / k k induced cycles of length k . Expand
On the inducibility of oriented graphs on four vertices
We consider the problem of determining the inducibility (maximum possible asymptotic density of induced copies) of oriented graphs on four vertices. For most of the graphs we prove the exact value,Expand
On the maximum number of copies of H in graphs with given size and order
It is shown that for any fixed graph, ex(n,e,H), the maximum number of copies of a graph, is asymptotically realized by the quasi-clique provided that the edge density is sufficiently large. Expand
Maximising the number of induced cycles in a graph
The maximum number of induced cycles that can be contained in a graph on n_0 vertices is determined, and it is shown that there is a unique graph that achieves this maximum and this answers a question of Tuza. Expand
The inducibility of complete bipartite graphs
For any s ≥ 1 and t ≥ (S2), we prove that among all graphs with n vertices the graph that contains the maximal number of induced copies of Kt, t+s for any fixed s ≥ 1 and t ≥ (s2) is K(n/2)+α(n/2)-αExpand
The Inducibility of Graphs on Four Vertices
  • J. Hirst
  • Mathematics, Computer Science
  • J. Graph Theory
  • 2014
The inducibility of K1, 1, 2 and the paw graph is determined using semidefinite programming techniques based on a modern language of extremal graph theory, which is described in full detail in an accessible setting. Expand


On the number of complete subgraphs contained in certain graphs
The number of complete graphs of order 4 contained in certain graphs is counted to find the total number of graphs in the graph LaSalle's inequality. Expand
On cliques in graphs
A clique is a maximal complete subgraph of a graph. The maximum number of cliques possible in a graph withn nodes is determined. Also, bounds are obtained for the number of different sizes of cliquesExpand
Extremal Graph Theory