Making <i>K</i><sub><i>r</i>+1</sub>-free graphs <i>r</i>-partite (Q5886101)
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 7670417
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Making <i>K</i><sub><i>r</i>+1</sub>-free graphs <i>r</i>-partite |
scientific article; zbMATH DE number 7670417 |
Statements
Making <i>K</i><sub><i>r</i>+1</sub>-free graphs <i>r</i>-partite (English)
0 references
30 March 2023
0 references
Erdős-Simonovits stability theorem
0 references
Turán number
0 references
extremal graphs
0 references
stability
0 references
0 references
0 references
0.8486449718475342
0 references
0.8407569527626038
0 references
0.8325481414794922
0 references
0.8273813724517822
0 references
0.8149681091308594
0 references
