A complexity problem for Borel graphs (Q2238048)
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 7416640
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complexity problem for Borel graphs |
scientific article; zbMATH DE number 7416640 |
Statements
A complexity problem for Borel graphs (English)
0 references
29 October 2021
0 references
\(\Sigma^1_2\)-complete
0 references
chromatic number
0 references
Borel chromatic number
0 references
Borel graph
0 references
Hedetniemi's conjecture
0 references
antibasis
0 references
0 references
0.8743273615837097
0 references
0.8606159687042236
0 references
0.853359580039978
0 references
0.8342099189758301
0 references
0.8087995648384094
0 references
