A new upper bound on the chromatic number of graphs with no odd $K_t$ minor. (arXiv:1912.07647v1 [math.CO]) http://arxiv.org/abs/1912.07647
CleverLibre Social is an inclusive social instance for open discussion, learning, and community. All cultures welcome. Hate speech and harassment strictly forbidden.