scientific article; zbMATH DE number 3821782

Cited in

(64)

On the number of edge disjoint cliques in graphs of given size
Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture
Supersaturation of C₄: from Zarankiewicz towards Erdős-Simonovits-Sidorenko
The minimum number of triangles in graphs of given order and size
Counting substructures. I: Color critical graphs
The feasible region of hypergraphs
Rainbow triangles and cliques in edge-colored graphs
The domination number of the graph defined by two levels of the \(n\)-cube
Unified approach to the generalized Turán problem and supersaturation
Supersaturation for subgraph counts
Extremal problems for pairs of triangles
The domination number of the graph defined by two levels of the \(n\)-cube. II
Structure and supersaturation for intersecting families
On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem
Frustrated triangles
The number of triangles is more when they have no common vertex
Counting substructures and eigenvalues. I: Triangles
Two approaches to Sidorenko's conjecture
Books versus triangles
The number of cliques in graphs of given order and size
Minimizing the number of triangular edges
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
The clique density theorem
On q-analogues and stability theorems
scientific article; zbMATH DE number 7020671 (Why is no real title available?)
On the number of K₄-saturating edges
On the KŁR conjecture in random graphs
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
Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
Supersaturation problem for color-critical graphs
The exact minimum number of triangles in graphs with given order and size
Asymptotic Structure for the Clique Density Theorem
Books versus triangles at the extremal density
Minimizing the number of 5-cycles in graphs with given edge-density
The number of additive triples in subsets of abelian groups
Asymptotic structure of graphs with the minimum number of triangles
A geometric theory for hypergraph matching
Subgraph densities in a surface
On a generalized Erdős–Rademacher problem
Regular Turán numbers and some Gan–Loh–Sudakov‐type problems
On stability of the Erdős-Rademacher problem
A spectral Erdős-Rademacher theorem
Cycles of length three and four in tournaments
Maximal chordal subgraphs
Counting rainbow triangles in edge-colored graphs
Ordered and colored subgraph density problems
A note on extremal constructions for the Erdős-Rademacher problem
New Ramsey multiplicity bounds and search heuristics
Counting substructures and eigenvalues. II: Quadrilaterals
A spectral Erdős-Faudree-Rousseau theorem
Spectral supersaturation: triangles and bowties
How many triangles can a graph have?
Supersaturation beyond color-critical graphs
More on Nosal's spectral theorem: books and 4-cycles
Supersaturation of odd linear cycles
Bowtie-saturated graphs and the spectral radius
Getting to the root of the problem: sums of squares for limits of trees
Cycles of length three and four in tournaments
Supersaturated graphs and hypergraphs
A Kruskal-Katona type theorem for graphs
On the maximum number of cliques in a graph

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 Q3669452)