scientific article; zbMATH DE number 3529891

zbMath0339.05115MaRDI QIDQ4106232

László Lovász, Miklós Simmonovits

Publication date: 1976

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items

Subgraph densities in a surface, Minimizing the Number of Triangular Edges, Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture, On sufficient conditions for rainbow cycles in edge-colored graphs, THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE, Asymptotic Structure of Graphs with the Minimum Number of Triangles, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Supersaturation problem for color-critical graphs, Optimal graphs for independence and \(k\)-independence polynomials, Rainbow triangles and cliques in edge-colored graphs, Supersaturation problem for the bowtie, On the maximum number of cliques in a graph, Dense neighbourhoods and Turan's theorem, Asymptotic Structure for the Clique Density Theorem, Triangle-degrees in graphs and tetrahedron coverings in 3-graphs, The maximum number of triangles in a \(K_4\)-free graph, The number of complete subgraphs of equi-partite graphs, Covering non-uniform hypergraphs, Supersaturation for subgraph counts