Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization (Q3629508): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Max-AO / rank | |||
Normal rank | |||
Revision as of 19:01, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization |
scientific article |
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
