---
res:
  bibo_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.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Xiaoyu
      foaf_name: He, Xiaoyu
      foaf_surname: He
  - foaf_Person:
      foaf_givenName: Yuval
      foaf_name: Wigderson, Yuval
      foaf_surname: Wigderson
      foaf_workInfoHomepage: http://www.librecat.org/personId=2d0023a0-1567-11f0-833d-d5c1e476d4b5
  bibo_doi: 10.1016/j.jctb.2020.03.003
  bibo_volume: 146
  dct_date: 2021^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0095-8956
  dct_language: eng
  dct_publisher: Elsevier@
  dct_subject:
  - Graph coloring
  - Hedetniemi's conjecture
  dct_title: Hedetniemi's conjecture is asymptotically false@
...