THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE
From MaRDI portal
Publication:5108414
DOI10.1017/fmp.2020.7zbMath1439.05108arXiv1712.00633OpenAlexW3098568300MaRDI QIDQ5108414
Oleg Pikhurko, Hong Liu, Katherine Staden
Publication date: 4 May 2020
Published in: Forum of Mathematics, Pi (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.00633
Related Items
Inducibility and universality for trees, Asymptotic Structure for the Clique Density Theorem, Sharp bounds for decomposing graphs into edges and triangles, The feasible region of induced graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clique polynomials have a unique root of smallest modulus
- The clique density theorem
- On the density of triangles and squares in regular finite and unimodular random graphs
- Supersaturation problem for color-critical graphs
- An approximate version of Sidorenko's conjecture
- On a theorem of Rademacher-Turán
- Supersaturated graphs and hypergraphs
- On the boundary of the region defined by homomorphism densities
- Counting substructures. I: Color critical graphs
- A correlation inequality for bipartite graphs
- Two approaches to Sidorenko’s conjecture
- 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
- On complete subgraphs of different orders
- Some advances on Sidorenko's conjecture
- Note on the Smallest Root of the Independence Polynomial
- Asymptotic Structure for the Clique Density Theorem
- Intersection theorems for systems of finite sets
- Asymptotic Structure of Graphs with the Minimum Number of Triangles
- Undecidability of linear inequalities in graph homomorphism densities
- Flag algebras
- On the 3‐Local Profiles of Graphs
- Triangles in an Ordinary Graph
- On the structure of linear graphs
- Supersaturation problem for the bowtie
- Graph norms and Sidorenko's conjecture
