Degree Powers in Graphs: The Erdős–Stone Theorem (Q2883853): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 04:32, 5 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
