A new coloring theorem of Kneser graphs (Q2431265)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5877164
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new coloring theorem of Kneser graphs |
scientific article; zbMATH DE number 5877164 |
Statements
A new coloring theorem of Kneser graphs (English)
0 references
11 April 2011
0 references
matching admissible sequences
0 references
chromatic number
0 references
circular chromatic number
0 references
Kneser graphs
0 references
octahedral Fan's Lemma
0 references
0 references
0 references
0 references
0.9298039
0 references
0.92914164
0 references
0.9280149
0 references
0.92632306
0 references
0.9238576
0 references
0 references
0.92063105
0 references
0.91725725
0 references
