scientific article; zbMATH DE number 3529891

MaRDI QIDQ4106232zbMATH OpenFDO

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

Publication date 1976

Mathematics Subject Classification ID

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

Cited in

(19)

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