On the Minimal Density of Triangles in Graphs (Q3527546): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Lower bounds on the number of triangles in a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Supersaturated graphs and hypergraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Flag algebras / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Clique polynomials have a unique root of smallest modulus / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Sets of Acquaintances and Strangers at any Party / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Triangles in an Ordinary Graph / rank | |||
Normal rank | |||
Revision as of 16:47, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Minimal Density of Triangles in Graphs |
scientific article |
Statements
On the Minimal Density of Triangles in Graphs (English)
0 references
29 September 2008
0 references
graph
0 references
density of triangles
0 references
