On the Minimal Density of Triangles in Graphs (Q3527546): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1017/s0963548308009085 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011575706 / rank
 
Normal rank

Latest revision as of 10:00, 30 July 2024

scientific article
Language Label Description Also known as
English
On the Minimal Density of Triangles in Graphs
scientific article

    Statements

    Identifiers