A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6637631 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
chromatic number | |||
| Property / zbMATH Keywords: chromatic number / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
circular chromatic number | |||
| Property / zbMATH Keywords: circular chromatic number / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Kneser graphs | |||
| Property / zbMATH Keywords: Kneser graphs / rank | |||
Normal rank | |||
Revision as of 03:04, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combinatorial proof for the circular chromatic number of Kneser graphs |
scientific article |
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
