The maximal number of induced complete bipartite graphs
From MaRDI portal
Publication:1088676
DOI10.1016/0012-365X(86)90214-1zbMath0613.05028MaRDI QIDQ1088676
Shun-ichi Tachibana, Béla Bollobás, Chie Nara
Publication date: 1986
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (22)
A bound on the inducibility of cycles ⋮ On the inducibility of oriented graphs on four vertices ⋮ The number of 4-cycles in triangle-free oriented graphs ⋮ Maximising the number of induced cycles in a graph ⋮ The inducibility of complete bipartite graphs ⋮ On the maximum number of copies of H in graphs with given size and order ⋮ The maximum number of induced C5's in a planar graph ⋮ On the exact maximum induced density of almost all graphs and their inducibility ⋮ Stability from graph symmetrisation arguments with applications to inducibility ⋮ The upper tail problem for induced 4‐cycles in sparse random graphs ⋮ Inducibility in the hypercube ⋮ Strong forms of stability from flag algebra calculations ⋮ The inducibility of blow-up graphs ⋮ On the maximal number of certain subgraphs in \(K_ r\)-free graphs ⋮ The chromatic uniqueness of complete bipartite graphs ⋮ A note on the inducibility of 4-vertex graphs ⋮ Maximum density of vertex-induced perfect cycles and paths in the hypercube ⋮ The Inducibility of Graphs on Four Vertices ⋮ On the inducibility of cycles ⋮ Inducibility of \(d\)-ary trees ⋮ The maximal number of induced \(r\)-partite subgraphs ⋮ On the 3‐Local Profiles of Graphs
Cites Work
This page was built for publication: The maximal number of induced complete bipartite graphs
