Degree Powers in Graphs: The Erdős–Stone Theorem (Q2883853): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stability for large forbidden subgraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs with many <i>r</i> -cliques have large complete <i>r</i> -partite subgraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Joints in graphs / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1017/s0963548311000654 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2026653526 / rank | |||
Normal rank |
Latest revision as of 09:01, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Degree Powers in Graphs: The Erdős–Stone Theorem |
scientific article |
Statements
Degree Powers in Graphs: The Erdős–Stone Theorem (English)
0 references
14 May 2012
0 references
Turan-type problem
0 references