The maximum number of edges in a \(\{K_{r+1},M_{k+1}\}\)-free graph (Q6985864)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8038154
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum number of edges in a \(\{K_{r+1},M_{k+1}\}\)-free graph |
scientific article; zbMATH DE number 8038154 |
Statements
The maximum number of edges in a \(\{K_{r+1},M_{k+1}\}\)-free graph (English)
0 references
12 May 2025
0 references
Turán number
0 references
alternating path
0 references
Zykov symmetrization
0 references
