The maximum size of \(r\)-partite subgraphs of a \(K^ 3\)-free graph (Q3981282)
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: The maximum size of \(r\)-partite subgraphs of a \(K^ 3\)-free graph |
scientific article; zbMATH DE number 21608
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The maximum size of \(r\)-partite subgraphs of a \(K^ 3\)-free graph |
scientific article; zbMATH DE number 21608 |
Statements
26 June 1992
0 references
maximum size
0 references
triangle-free
0 references
colour class
0 references
0.8419438004493713
0 references
0.840643048286438
0 references
0.8288668394088745
0 references
0.809963047504425
0 references