The chromatic number of $G\times H$ can be smaller than the minimum of the chromatic numbers of finite simple graphs $G$ and $H$.
About dependence of the number of edges and vertices in hypergraph clique with chromatic number 3
Topological lower bounds for the chromatic number: A hierarchy
The chromatic number of a signed graph
![QR code for arXiv:1905.02167 [math.CO]](http://oss.arxitics.com/images/favicon.svg)