[{"publication":"Journal of Combinatorial Theory, Series B","publication_identifier":{"issn":["0095-8956"]},"doi":"10.1016/j.jctb.2020.03.003","date_created":"2026-06-29T10:50:09Z","year":"2021","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1906.06783","open_access":"1"}],"quality_controlled":"1","OA_place":"repository","volume":146,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"He, Xiaoyu","first_name":"Xiaoyu","last_name":"He"},{"last_name":"Wigderson","first_name":"Yuval","full_name":"Wigderson, Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5"}],"extern":"1","keyword":["Graph coloring","Hedetniemi's conjecture"],"title":"Hedetniemi's conjecture is asymptotically false","publication_status":"published","external_id":{"arxiv":["1906.06783"]},"abstract":[{"lang":"eng","text":"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."}],"article_processing_charge":"No","page":"485-494","status":"public","day":"01","OA_type":"green","citation":{"ieee":"X. He and Y. Wigderson, “Hedetniemi’s conjecture is asymptotically false,” <i>Journal of Combinatorial Theory, Series B</i>, vol. 146. Elsevier, pp. 485–494, 2021.","short":"X. He, Y. Wigderson, Journal of Combinatorial Theory, Series B 146 (2021) 485–494.","ista":"He X, Wigderson Y. 2021. Hedetniemi’s conjecture is asymptotically false. Journal of Combinatorial Theory, Series B. 146, 485–494.","ama":"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>","apa":"He, X., &#38; Wigderson, Y. (2021). Hedetniemi’s conjecture is asymptotically false. <i>Journal of Combinatorial Theory, Series B</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jctb.2020.03.003\">https://doi.org/10.1016/j.jctb.2020.03.003</a>","chicago":"He, Xiaoyu, and Yuval Wigderson. “Hedetniemi’s Conjecture Is Asymptotically False.” <i>Journal of Combinatorial Theory, Series B</i>. Elsevier, 2021. <a href=\"https://doi.org/10.1016/j.jctb.2020.03.003\">https://doi.org/10.1016/j.jctb.2020.03.003</a>.","mla":"He, Xiaoyu, and Yuval Wigderson. “Hedetniemi’s Conjecture Is Asymptotically False.” <i>Journal of Combinatorial Theory, Series B</i>, vol. 146, Elsevier, 2021, pp. 485–94, doi:<a href=\"https://doi.org/10.1016/j.jctb.2020.03.003\">10.1016/j.jctb.2020.03.003</a>."},"scopus_import":"1","_id":"22156","type":"journal_article","oa_version":"Preprint","intvolume":"       146","article_type":"original","date_updated":"2026-07-08T07:43:57Z","arxiv":1,"publisher":"Elsevier","date_published":"2021-01-01T00:00:00Z","language":[{"iso":"eng"}],"month":"01","oa":1}]