The maximal number of induced \(r\)-partite subgraphs

DOI10.1007/BF01787417zbMath0819.05034OpenAlexW2041193896MaRDI QIDQ1805369

Guoping Jin, Yoshimi Egawa, Béla Bollobás, Andrew T. Harris

Publication date: 11 May 1995

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01787417

zbMATH Keywords

bound\(r\)-partite graph\(r\)-partite Turán graphinduced \(r\)-partite subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items

A bound on the inducibility of cycles, On the inducibility of oriented graphs on four vertices, Maximising the number of induced cycles in a graph, 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, Strong forms of stability from flag algebra calculations, The inducibility of blow-up graphs, A note on the inducibility of 4-vertex graphs, On the inducibility of cycles, Inducibility of \(d\)-ary trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximal number of induced complete bipartite graphs
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• The inducibility of graphs
• The inducibility of complete bipartite graphs
• The Maximum Number of Strongly Connected Subtournaments^*
• On cliques in graphs