scientific article; zbMATH DE number 3529891

zbMATH Open0339.05115MaRDI QIDQ4106232FDOQ4106232

Authors: Miklós Simonovits, László Lovász 

Publication date: 1976

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (20)

• The exact minimum number of triangles in graphs with given order and size
• Minimizing the number of triangular edges
• Supersaturation for subgraph counts
• A spectral Erdős-Rademacher theorem
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Optimal graphs for independence and \(k\)-independence polynomials
• Rainbow triangles and cliques in edge-colored graphs
• Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
• Supersaturation problem for the bowtie
• Covering non-uniform hypergraphs
• Subgraph densities in a surface
• Asymptotic Structure for the Clique Density Theorem
• Dense neighbourhoods and Turan's theorem
• On the maximum number of cliques in a graph
• Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture
• The maximum number of triangles in a \(K_4\)-free graph
• Supersaturation problem for color-critical graphs
• Asymptotic structure of graphs with the minimum number of triangles
• The number of complete subgraphs of equi-partite graphs
• On sufficient conditions for rainbow cycles in edge-colored graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4106232)