Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization (Q3629508)
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: Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization |
scientific article; zbMATH DE number 5558469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization |
scientific article; zbMATH DE number 5558469 |
Statements
Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization (English)
0 references
27 May 2009
0 references
chromatic number
0 references
Lovász theta number
0 references
semidefinite programming
0 references
Terwilliger algebra
0 references
Hamming graph
0 references
Kneser graph
0 references
0.8086739182472229
0 references
0.8052077889442444
0 references
0.8008955121040344
0 references
0.7974981069564819
0 references
0.7912359237670898
0 references
