@article{22156,
  abstract     = {Extending a recent breakthrough of Shitov, we prove that the chromatic number of the tensor product of two graphs can be a constant factor smaller than the minimum chromatic number of the two graphs. More precisely, we prove that there exists an absolute constant δ>0 such that for all c sufficiently large, there exist graphs G and H with chromatic number at least (1+δ)c for which χ(G×H)≤c.},
  author       = {He, Xiaoyu and Wigderson, Yuval},
  issn         = {0095-8956},
  journal      = {Journal of Combinatorial Theory, Series B},
  keywords     = {Graph coloring, Hedetniemi's conjecture},
  pages        = {485--494},
  publisher    = {Elsevier},
  title        = {{Hedetniemi's conjecture is asymptotically false}},
  doi          = {10.1016/j.jctb.2020.03.003},
  volume       = {146},
  year         = {2021},
}