Many \(T\) copies in \(H\)-free graphs (Q5965526): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jctb.2016.03.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1533675320 / rank | |||
Normal rank | |||
Revision as of 19:16, 19 March 2024
scientific article; zbMATH DE number 6637919
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Many \(T\) copies in \(H\)-free graphs |
scientific article; zbMATH DE number 6637919 |
Statements
Many \(T\) copies in \(H\)-free graphs (English)
0 references
12 October 2016
0 references
extremal graph theory
0 references
\(H\)-free graphs
0 references
projective norm graphs
0 references
complete graphs
0 references
complete bipartite graphs
0 references
