Maximizing the density of \(K_t\)'s in graphs of bounded degree and clique number (Q2174573)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximizing the density of \(K_t\)'s in graphs of bounded degree and clique number |
scientific article |
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
