The minimum number of triangles in graphs of given order and size
From MaRDI portal
Publication:1690017
DOI10.1016/j.endm.2017.07.039zbMath1378.05101OpenAlexW2963397307MaRDI QIDQ1690017
Hong Liu, Oleg Pikhurko, Katherine Staden
Publication date: 18 January 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2017.07.039
Related Items
Structure and supersaturation for intersecting families, The minimum number of triangles in graphs of given order and size, Books versus Triangles at the Extremal Density, Minimizing the number of 5-cycles in graphs with given edge-density
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The clique density theorem
- On a theorem of Rademacher-Turán
- The minimum number of triangles in graphs of given order and size
- 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
- Inequalities for functionals generated by bipartite graphs
- Asymptotic Structure of Graphs with the Minimum Number of Triangles
- Flag algebras
- Triangles in an Ordinary Graph
- On the structure of linear graphs