Follow

A new upper bound on the chromatic number of graphs with no odd $K_t$ minor. (arXiv:1912.07647v1 [math.CO]) arxiv.org/abs/1912.07647

· · feed2toot · 0 · 0 · 0
Sign in to participate in the conversation
Qoto Mastodon

QOTO: Question Others to Teach Ourselves
An inclusive, Academic Freedom, instance
All cultures welcome.
Hate speech and harassment strictly forbidden.