Maximizing the density of \(K_t\)'s in graphs of bounded degree and clique number (Q2174573)
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: Maximizing the density of K_t's in graphs of bounded degree and clique number |
scientific article; zbMATH DE number 7191161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing the density of \(K_t\)'s in graphs of bounded degree and clique number |
scientific article; zbMATH DE number 7191161 |
Statements
Maximizing the density of \(K_t\)'s in graphs of bounded degree and clique number (English)
0 references
21 April 2020
0 references
cliques
0 references
maximum degree
0 references
clique number
0 references
extremal enumerative problems
0 references
0.7933008670806885
0 references
0.7808895111083984
0 references
0.7756264805793762
0 references
0.7754958271980286
0 references
0.7646786570549011
0 references
