Lower bounds on the number of triangles in a graph (Q3826589): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1002/jgt.3190130411 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2078321205 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3852212 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Triangles in an Ordinary Graph / rank | |||
Normal rank |
Latest revision as of 14:23, 19 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lower bounds on the number of triangles in a graph |
scientific article |
Statements
Lower bounds on the number of triangles in a graph (English)
0 references
1989
0 references
number of complete subgraphs
0 references
spectral radius
0 references
number of triangles
0 references