arXiv:1905.02167math.CO2019-05-06

Counterexamples to Hedetniemi's conjecture

Yaroslav Shitov

Abstract

The chromatic number of $G\times H$ can be smaller than the minimum of the chromatic numbers of finite simple graphs $G$ and $H$.

arXiv comments: 3 pages, minor corrections, a version accepted for publication
Journal reference
DOI
Subjects: math.COCombinatorics

On Hacker News

Linked by 2 identifiable commenters in 2 comments across 1 thread, from Jun 2019 to Jun 2019.

Comments linking this paper, per year.

Discussed in comments1 thread

Mathematician Disproves Hedetniemi’s Graph Theory Conjecture Jun 20192 comments
- Looks like this is the paper: COUNTEREXAMPLES TO HEDETNIEMI’S CONJECTURE https://arxiv.org/pdf/1905.02167.pdf
  
  _blz2Jun 17, 2019View on HN Parent context
- Link to abstract: https://arxiv.org/abs/1905.02167 .
  
  JadeNBJun 18, 2019View on HN Parent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.