The inducibility of complete bipartite graphs

DOI10.1002/jgt.3190180610zbMath0810.05037OpenAlexW2088584953MaRDI QIDQ4309990

Alexander Sidorenko, Jason I. Brown

Publication date: 9 April 1995

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190180610

zbMATH Keywords

asymptotically optimalcomplete multipartite graphsinducibility

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items

A bound on the inducibility of cycles, Inducibility and universality for trees, On the inducibility of oriented graphs on four vertices, Maximising the number of induced cycles in a graph, C5 ${C}_{5}$ is almost a fractalizer, 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, Some exact results for non-degenerate generalized Turán problems, Inducibility in the hypercube, Strong forms of stability from flag algebra calculations, The inducibility of blow-up 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, Some sharp results on the generalized Turán numbers, On the inducibility of cycles, Inducibility of \(d\)-ary trees, The maximal number of induced \(r\)-partite subgraphs, Edge-statistics on large graphs, On the 3‐Local Profiles of Graphs, The feasible region of induced graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
• Asymptotic solution for a new class of forbidden r-graphs
• The maximal number of induced complete bipartite graphs
• Hypergraphs do not jump
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• On the number of subgraphs of prescribed type of graphs with a given number of edges
• Extremals of functions on graphs with applications to graphs and hypergraphs
• The inducibility of graphs
• The edge inducibility of graphs
• Maxima for Graphs and a New Proof of a Theorem of Turán