Improved bound on the maximum number of clique-free colorings with two and three colors (Q4568091)
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: Improved bound on the maximum number of clique-free colorings with two and three colors |
scientific article; zbMATH DE number 6890189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved bound on the maximum number of clique-free colorings with two and three colors |
scientific article; zbMATH DE number 6890189 |
Statements
Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors (English)
0 references
15 June 2018
0 references
Erdős-Rothschild type problems
0 references
clique-free colorings
0 references
container method
0 references
edge colorings
0 references
0.8633570075035095
0 references
0.8257946372032166
0 references
0.8152859210968018
0 references
0.8077954649925232
0 references
0.8077954053878784
0 references
