Bounds on the number of complete subgraphs (Q1195482): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Jennifer K. Ryan / rank | |||
Property / author | |||
Property / author: Jennifer K. Ryan / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3835498 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3852212 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of complete subgraphs and circuits contained in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The number of triangles in a \(K_ 4\)-free graph / rank | |||
Normal rank | |||
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: Q3478424 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Triangles in an Ordinary Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A generalization of a theorem of Turán / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the theory of graphs / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(92)90323-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2074614998 / rank | |||
Normal rank |
Latest revision as of 10:54, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bounds on the number of complete subgraphs |
scientific article |
Statements
Bounds on the number of complete subgraphs (English)
0 references
6 December 1992
0 references
clique number
0 references
number of complete subgraphs
0 references
Turán's theorem
0 references
bound
0 references