On the minimal degree condition of graphs implying equality of the largest \(K_r\)-free subgraphs and \((r - 1)\)-partite subgraphs (Q2032881)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the minimal degree condition of graphs implying equality of the largest \(K_r\)-free subgraphs and \((r - 1)\)-partite subgraphs |
scientific article; zbMATH DE number 7358450
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the minimal degree condition of graphs implying equality of the largest \(K_r\)-free subgraphs and \((r - 1)\)-partite subgraphs |
scientific article; zbMATH DE number 7358450 |
Statements
On the minimal degree condition of graphs implying equality of the largest \(K_r\)-free subgraphs and \((r - 1)\)-partite subgraphs (English)
0 references
14 June 2021
0 references
minimal degree
0 references
\( K_r\)-free subgraph
0 references
\(r\)-partite subgraph
0 references
0 references
0 references
