Many \(T\) copies in \(H\)-free graphs (Q5890921): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1409.4192 / rank | |||
Normal rank | |||
Revision as of 12:37, 18 April 2024
scientific article; zbMATH DE number 6639434
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Many \(T\) copies in \(H\)-free graphs |
scientific article; zbMATH DE number 6639434 |
Statements
Many \(T\) copies in \(H\)-free graphs (English)
0 references
14 October 2016
0 references
extremal combinatorics
0 references
Turán-type problems
0 references
