Hedetniemi's conjecture is asymptotically false He, Xiaoyu Wigderson, Yuval Graph coloring Hedetniemi's conjecture 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. Elsevier 2021 info:eu-repo/semantics/article doc-type:article text http://purl.org/coar/resource_type/c_2df8fbb1 https://research-explorer.ista.ac.at/record/22156 He X, Wigderson Y. Hedetniemi’s conjecture is asymptotically false. <i>Journal of Combinatorial Theory, Series B</i>. 2021;146:485-494. doi:<a href="https://doi.org/10.1016/j.jctb.2020.03.003">10.1016/j.jctb.2020.03.003</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1016/j.jctb.2020.03.003 info:eu-repo/semantics/altIdentifier/issn/0095-8956 info:eu-repo/semantics/altIdentifier/arxiv/1906.06783 info:eu-repo/semantics/openAccess