Clique supersaturation

DOI10.1137/24M1642172MaRDI QIDQ6932387zbMATH OpenFDO

Authors Quentin Dubroff, Benjamin Gunby, Bhargav P. Narayanan, Sam Spiro

Publication date 9 September 2025

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M1642172

zbMATH Keywords

random graphssupersaturationTurán numbers

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Random graphs (graph-theoretic aspects) (05C80)

Cites work

• A Note on Bipartite Graphs Without 2 k -Cycles
• Graphs with few paths of prescribed length between any two vertices
• Graphs without theta subgraphs
• scientific article; zbMATH DE number 4216032 (Why is no real title available?)
• scientific article; zbMATH DE number 3900799 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Hypergraph containers
• Independent sets in hypergraphs
• Many \(T\) copies in \(H\)-free graphs
• On supersaturation and stability for generalized Turán problems
• On the Minimal Density of Triangles in Graphs
• Ramsey numbers and the Zarankiewicz problem
• Random polynomial graphs for random Turán problems
• Rational exponents in extremal graph theory
• Supersaturated graphs and hypergraphs
• Supersaturation for subgraph counts
• The asymptotics of r(4,t)
• The clique density theorem
• The number of \(C_{2\ell}\)-free graphs
• Unified approach to the generalized Turán problem and supersaturation

This page was built for publication: Clique supersaturation

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