A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473)
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 combinatorial proof for the circular chromatic number of Kneser graphs |
scientific article; zbMATH DE number 6637631
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A combinatorial proof for the circular chromatic number of Kneser graphs |
scientific article; zbMATH DE number 6637631 |
Statements
A combinatorial proof for the circular chromatic number of Kneser graphs (English)
0 references
12 October 2016
0 references
chromatic number
0 references
circular chromatic number
0 references
Kneser graphs
0 references
0.8950981497764587
0 references
0.8949781060218811
0 references
0.8752620220184326
0 references
0.847324013710022
0 references
0.8416389226913452
0 references
