Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite. (Q2488527)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite. |
scientific article |
Statements
Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite. (English)
0 references
24 May 2006
0 references
shortest odd cycle
0 references
maximum size
0 references
Turán's theorem
0 references
extremal graphs
0 references
