Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
chromatic number
tensor product of graphs |
| gptkbp:debunkedBy |
Yaroslav Shitov
|
| gptkbp:disprovedInYear |
2019
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Hedetniemi's conjecture
|
| gptkbp:proposedBy |
Stephen T. Hedetniemi
|
| gptkbp:relatedTo |
graph coloring
graph homomorphism product of graphs |
| gptkbp:sentence |
The chromatic number of the tensor product of two finite graphs is equal to the minimum of their chromatic numbers.
|
| gptkbp:status |
disproved
|
| gptkbp:yearProposed |
1966
|
| gptkbp:bfsParent |
gptkb:Stephen_Hedetniemi
|
| gptkbp:bfsLayer |
8
|