scientific article

zbMath0519.05042MaRDI QIDQ3669452

Miklós Simmonovits

Publication date: 1983

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

zbMATH Keywords

extremal graphscomplete subgraphs

Mathematics Subject Classification ID

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

Related Items (49)

Subgraph densities in a surface ⋮ Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko ⋮ Books Versus triangles ⋮ Extremal problems for pairs of triangles ⋮ Minimizing the Number of Triangular Edges ⋮ Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture ⋮ The clique density theorem ⋮ The number of triangles is more when they have no common vertex ⋮ On a generalized Erdős–Rademacher problem ⋮ Structure and supersaturation for intersecting families ⋮ The minimum number of triangles in graphs of given order and size ⋮ Regular Turán numbers and some Gan–Loh–Sudakov‐type problems ⋮ On \(q\)-analogues and stability theorems ⋮ THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE ⋮ On stability of the Erdős-Rademacher problem ⋮ The number of additive triples in subsets of abelian groups ⋮ Asymptotic Structure of Graphs with the Minimum Number of Triangles ⋮ Counting substructures and eigenvalues. I: Triangles ⋮ Counting substructures. I: Color critical graphs ⋮ On the number of \(K_4\)-saturating edges ⋮ On the KŁR conjecture in random graphs ⋮ The domination number of the graph defined by two levels of the \(n\)-cube. II ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On the number of edge disjoint cliques in graphs of given size ⋮ On the density of triangles and squares in regular finite and unimodular random graphs ⋮ Counting substructures. II: Hypergraphs ⋮ A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity ⋮ On the number of monotone sequences ⋮ Supersaturation problem for color-critical graphs ⋮ The feasible region of hypergraphs ⋮ A Kruskal-Katona type theorem for graphs ⋮ Rainbow triangles and cliques in edge-colored graphs ⋮ The domination number of the graph defined by two levels of the \(n\)-cube ⋮ Supersaturation problem for the bowtie ⋮ Two approaches to Sidorenko’s conjecture ⋮ On the maximum number of cliques in a graph ⋮ On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem ⋮ Frustrated triangles ⋮ Books versus Triangles at the Extremal Density ⋮ The number of cliques in graphs of given order and size ⋮ Asymptotic Structure for the Clique Density Theorem ⋮ Minimizing the number of 5-cycles in graphs with given edge-density ⋮ Unified approach to the generalized Turán problem and supersaturation ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs ⋮ Cycles of length three and four in tournaments ⋮ A geometric theory for hypergraph matching ⋮ Unnamed Item ⋮ Supersaturated graphs and hypergraphs ⋮ Supersaturation for subgraph counts

This page was built for publication: