A problem of Erdős on the minimum number of \(k\)-cliques (Q744160): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
(8 intermediate revisions by 6 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.jctb.2013.02.003 / rank | |||
Property / author | |||
Property / author: Benjamin Sudakov / rank | |||
Property / author | |||
Property / author: Benjamin Sudakov / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2096807443 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1203.2723 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3503433 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the connection between chromatic number, maximal clique and minimal degree of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hypergraphs Do Jump / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5724802 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the maximum number of five-cycles in a triangle-free graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of pentagons in triangle-free graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3089368 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Blue-Empty Chromatic Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Minimum Number of <i>k</i>-Cliques in Graphs with Restricted Independence Number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Flag algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Minimal Density of Triangles in Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On 3-Hypergraphs with Forbidden 4-Vertex Configurations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5781249 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5790850 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.JCTB.2013.02.003 / rank | |||
Normal rank |
Latest revision as of 02:47, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A problem of Erdős on the minimum number of \(k\)-cliques |
scientific article |
Statements
A problem of Erdős on the minimum number of \(k\)-cliques (English)
0 references
6 October 2014
0 references
minimum number of \(k\)-cliques
0 references
0 references
0 references