The typical structure of graphs with no large cliques (Q681594)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The typical structure of graphs with no large cliques |
scientific article |
Statements
The typical structure of graphs with no large cliques (English)
0 references
12 February 2018
0 references
It was previously known that almost all \(K_{r+1}\)-free graphs with \(n\) vertices are \(r\)-partite for every fixed \(r\). The authors extend this result to \(K_{r+1}\)-free graphs where \(r\) is a function which is allowed to grow with \(n\).
0 references
cliques
0 references
triangle-free graphs
0 references
stability theorem
0 references
0 references
