On the maximal number of certain subgraphs in \(K_ r\)-free graphs

DOI10.1007/BF01789461zbMath0755.05050OpenAlexW2089149854MaRDI QIDQ1175549

János Pach, Ervin Gyoeri, Miklós Simmonovits

Publication date: 25 June 1992

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

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

zbMATH Keywords

triangle-free graphcolour classes\(K_ r\)-free graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (26)

Some exact results for generalized Turán problems ⋮ The maximum number of paths of length four in a planar graph ⋮ Generalized Turán problems for double stars ⋮ Paths are Turán-good ⋮ On a generalization of the spectral Mantel's theorem ⋮ Generalized Turán results for intersecting cliques ⋮ The cycle of length four is strictly \(F\)-Turán-good ⋮ Stability version of Dirac's theorem and its applications for generalized Turán problems ⋮ Some exact results for non-degenerate generalized Turán problems ⋮ Every graph is eventually Turán-good ⋮ Exact generalized Turán number for \(K_3\) versus suspension of \(P_4\) ⋮ Generalized Turán problems for \(K_{2,t}\) ⋮ Subgraph densities in \(K_r\)-free graphs ⋮ Triangles in graphs without bipartite suspensions ⋮ Some exact results of the generalized Turán numbers for paths ⋮ Some sharp results on the generalized Turán numbers ⋮ On Turán-good graphs ⋮ Some results on \(k\)-Turán-good graphs ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ The maximal number of induced \(r\)-partite subgraphs ⋮ A note on a conjecture of Gallai ⋮ Maximizing five-cycles in \(K_r\)-free graphs ⋮ Unified approach to the generalized Turán problem and supersaturation ⋮ Counting copies of a fixed subgraph in \(F\)-free graphs ⋮ Generalized Turán problems for complete bipartite graphs ⋮ Supersaturation for subgraph counts

Cites Work

• The maximal number of induced complete bipartite graphs
• On the number of \(C_ 5's\) in a triangle-free graph
• A generalization of a theorem of Turán
• On the number of complete subgraphs and circuits contained in graphs
• On the theory of graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On the maximal number of certain subgraphs in \(K_ r\)-free graphs