A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) (Q1686044)
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: A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) |
scientific article; zbMATH DE number 6820599
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) |
scientific article; zbMATH DE number 6820599 |
Statements
A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) (English)
0 references
20 December 2017
0 references
non-equivalent colorings
0 references
graphical Bell number
0 references
extremal theory
0 references
fixed maximum degree
0 references
0.88899684
0 references
0.8882433
0 references
0.87673306
0 references
0.8759701
0 references
0.8752904
0 references
0.8741129
0 references
0.8736968
0 references
0.8736509
0 references
