The clique density theorem
From MaRDI portal
Publication:338418
DOI10.4007/annals.2016.184.3.1zbMath1348.05103arXiv1212.2454OpenAlexW1555702583MaRDI QIDQ338418
Publication date: 4 November 2016
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.2454
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42)
Related Items (47)
Subgraph densities in a surface ⋮ Minimizing cycles in tournaments and normalized \(q\)-norms ⋮ Inducibility and universality for trees ⋮ Graph theory -- a survey on the occasion of the Abel Prize for László Lovász ⋮ Rainbow triangles in three-colored graphs ⋮ A path forward: tropicalization in extremal combinatorics ⋮ Multipodal structure and phase transitions in large constrained graphs ⋮ Supersaturation in posets and applications involving the container method ⋮ Tropicalization of graph profiles ⋮ Sidorenko's conjecture for blow-ups ⋮ On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory ⋮ Structure and supersaturation for intersecting families ⋮ On the local approach to Sidorenko's conjecture ⋮ The minimum number of triangles in graphs of given order and size ⋮ Regular Turán numbers and some Gan–Loh–Sudakov‐type problems ⋮ THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE ⋮ Finding Cliques in Social Networks: A New Distribution-Free Model ⋮ Unnamed Item ⋮ Trivial colors in colorings of Kneser graphs ⋮ Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) ⋮ Asymptotic Structure of Graphs with the Minimum Number of Triangles ⋮ On the Lower Tail Variational Problem for Random Graphs ⋮ On the Number of 4-Edge Paths in Graphs With Given Edge Density ⋮ Extremal results in sparse pseudorandom graphs ⋮ Edges not in any monochromatic copy of a fixed graph ⋮ On the KŁR conjecture in random graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On the number of monotone sequences ⋮ Maximizing proper colorings on graphs ⋮ Supersaturation problem for color-critical graphs ⋮ Semidefinite Programming and Ramsey Numbers ⋮ The feasible region of hypergraphs ⋮ Supersaturation problem for the bowtie ⋮ Two approaches to Sidorenko’s conjecture ⋮ Books versus Triangles at the Extremal Density ⋮ Asymptotic Structure for the Clique Density Theorem ⋮ Minimizing the number of 5-cycles in graphs with given edge-density ⋮ Minimum number of edges that occur in odd cycles ⋮ Unified approach to the generalized Turán problem and supersaturation ⋮ Stability Results for Two Classes of Hypergraphs ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs ⋮ Cycles of length three and four in tournaments ⋮ Paths in Hypergraphs: A Rescaling Phenomenon ⋮ Compactness and finite forcibility of graphons ⋮ On a Conjecture of Nagy on Extremal Densities ⋮ The feasible region of induced graphs ⋮ Supersaturation for subgraph counts
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clique polynomials have a unique root of smallest modulus
- The number of cliques in graphs of given order and size
- On Sets of Acquaintances and Strangers at any Party
- On the Minimal Density of Triangles in Graphs
- Lower bounds on the number of triangles in a graph
- A Remark on the Number of Complete and Empty Subgraphs
- Note on the Smallest Root of the Independence Polynomial
- Flag algebras
- Triangles in an Ordinary Graph
This page was built for publication: The clique density theorem
