Tight lower bounds for the complexity of multicoloring (Q5111704)
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: Tight lower bounds for the complexity of multicoloring |
scientific article; zbMATH DE number 7204996
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight lower bounds for the complexity of multicoloring |
scientific article; zbMATH DE number 7204996 |
Statements
27 May 2020
0 references
multicoloring
0 references
Kneser graph
0 references
homomorphism
0 references
ETH lower bound
0 references
0 references
0 references
0 references
0 references
0 references
Tight Lower Bounds for the Complexity of Multicoloring (English)
0 references
0.9948534369468688
0 references
0.7714400887489319
0 references
0.7324568629264832
0 references
0.7296476364135742
0 references
0.7259734272956848
0 references
