The maximum number of complete subgraphs in a graph with given maximum degree (Q2434716)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6256083
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum number of complete subgraphs in a graph with given maximum degree |
scientific article; zbMATH DE number 6256083 |
Statements
The maximum number of complete subgraphs in a graph with given maximum degree (English)
0 references
6 February 2014
0 references
independent sets
0 references
complete subgraphs
0 references
extremal enumeration
0 references
0.8765867352485657
0 references
0.8191128969192505
0 references
0.808190643787384
0 references
0.8074010014533997
0 references
0.8008057475090027
0 references
