The number of cliques in graphs of given order and size
From MaRDI portal
Publication:3085139
DOI10.1090/S0002-9947-2010-05189-XzbMath1231.05129arXiv0710.2305OpenAlexW2166750439MaRDI QIDQ3085139
Publication date: 28 March 2011
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0710.2305
Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (50)
Subgraph densities in a surface ⋮ Cliques in Graphs With Bounded Minimum Degree ⋮ Minimizing cycles in tournaments and normalized \(q\)-norms ⋮ Inducibility and universality for trees ⋮ Counting independent sets in triangle-free graphs ⋮ The clique density theorem ⋮ Rainbow triangles in three-colored graphs ⋮ A path forward: tropicalization in extremal combinatorics ⋮ Complete subgraphs in connected graphs and its application to spectral moment ⋮ Tropicalization of graph profiles ⋮ An approximate version of Sidorenko's conjecture ⋮ Sidorenko's conjecture for blow-ups ⋮ 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 ⋮ 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 ⋮ The number of additive triples in subsets of abelian groups ⋮ 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 ⋮ Counting substructures. II: Hypergraphs ⋮ On the number of monotone sequences ⋮ Note on the Smallest Root of the Independence Polynomial ⋮ Turán and Ramsey Properties of Subcube Intersection Graphs ⋮ Supersaturation problem for color-critical graphs ⋮ The feasible region of hypergraphs ⋮ Supersaturation problem for the bowtie ⋮ On the densities of cliques and independent sets in graphs ⋮ Two approaches to Sidorenko’s conjecture ⋮ On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem ⋮ On clique values identities and mantel-type theorems ⋮ 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 ⋮ Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal ⋮ On the Number of 4-Cycles in a Tournament ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs ⋮ On the 3‐Local Profiles of Graphs ⋮ Cycles of length three and four in tournaments ⋮ Compactness and finite forcibility of graphons ⋮ The feasible region of induced graphs ⋮ Supersaturation for subgraph counts
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a theorem of Rademacher-Turán
- On the Minimal Density of Triangles in Graphs
- Very large graphs
- Lower bounds on the number of triangles in a graph
- On complete subgraphs of different orders
- Flag algebras
- On the number of complete subgraphs and circuits contained in graphs
This page was built for publication: The number of cliques in graphs of given order and size
