New construction of graphs with high chromatic number and small clique number (Q1702354)
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: New construction of graphs with high chromatic number and small clique number |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New construction of graphs with high chromatic number and small clique number |
scientific article |
Statements
New construction of graphs with high chromatic number and small clique number (English)
0 references
28 February 2018
0 references
Borsuk-Ulam theorem
0 references
chromatic number
0 references
Tucker's lemma
0 references
triangle-free graphs
0 references
0.89676076
0 references
0.8943919
0 references
0.8902487
0 references
0.8891165
0 references
0.88748956
0 references
0.8852529
0 references
0.88143367
0 references
0.8804504
0 references
0.88016963
0 references
