{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T16:28:06Z","timestamp":1747153686089,"version":"3.40.5"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T00:00:00Z","timestamp":1665532800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T00:00:00Z","timestamp":1665532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s00373-022-02576-x","type":"journal-article","created":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T12:05:28Z","timestamp":1665576328000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Counterexamples to Hedetniemi\u2019s Conjecture with Large Fractional Chromatic Numbers"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3855-989X","authenticated-orcid":false,"given":"Claude","family":"Tardif","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"key":"2576_CR1","first-page":"167","volume":"1","author":"SA Burr","year":"1976","unstructured":"Burr, S.A., Erd\u0151s, P., Lov\u00e1sz, L.: On graphs of Ramsey type. Ars Combinatoria 1, 167\u2013190 (1976)","journal-title":"Ars Combinatoria"},{"key":"2576_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF02579374","volume":"5","author":"M El-Zahar","year":"1985","unstructured":"El-Zahar, M., Sauer, N.: The chromatic number of the product of two $$4$$-chromatic graphs is $$4$$. Combinatorica 5, 121\u2013126 (1985)","journal-title":"Combinatorica"},{"key":"2576_CR3","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0012-365X(94)00311-6","volume":"152","author":"G Gao","year":"1996","unstructured":"Gao, G., Zhu, X.: Star-extremal graphs and lexicographic product. Discrete Math. 152, 147\u2013156 (1996)","journal-title":"Discrete Math."},{"key":"2576_CR4","unstructured":"The GAP Group.: GAP\u2013Groups, algorithms, and programming, Version 4.11.1. (2021). https:\/\/www.gap-system.org"},{"key":"2576_CR5","unstructured":"Hedetniemi, S.: Homomorphisms of graphs and automata, Technical Report 03105-44-T, University of Michigan. (1966)"},{"issue":"190","key":"2576_CR6","first-page":"663","volume":"2","author":"Y Shitov","year":"2019","unstructured":"Shitov, Y.: Counterexamples to Hedetniemi\u2019s conjecture. Ann. Math. 2(190), 663\u2013667 (2019)","journal-title":"Ann. Math."},{"key":"2576_CR7","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s00493-006-0034-x","volume":"26","author":"G Simonyi","year":"2006","unstructured":"Simonyi, G., Tardos, G.: Local chromatic number. Ky Fan\u2019s Theorem and circular colorings. Combinatorica 26, 587\u2013626 (2006)","journal-title":"Combinatorica"},{"key":"2576_CR8","unstructured":"Soicher, L.H.: GRAPE, graph algorithms using permutation groups-a refereed GAP package, Version 4.8.5. (2021). (https:\/\/gap-packages.github.io\/grape)"},{"key":"2576_CR9","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s00493-021-4781-5","volume":"42","author":"C Tardif","year":"2022","unstructured":"Tardif, C.: The chromatic number of the product of 14-chromatic graphs can be 13. Combinatorica 42, 301\u2013308 (2022)","journal-title":"Combinatorica"},{"key":"2576_CR10","first-page":"461","volume":"24","author":"D Turz\u00edk","year":"1983","unstructured":"Turz\u00edk, D.: A note on chromatic number of direct product of graphs. Comment. Math. Univ. Carolin. 24, 461\u2013463 (1983)","journal-title":"Comment. Math. Univ. Carolin."},{"key":"2576_CR11","unstructured":"Wrochna, M.: Smaller counterexamples to Hedetniemi\u2019s conjecture. (2022). https:\/\/arxiv.org\/abs\/2012.13558 [math.CO]"},{"key":"2576_CR12","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1016\/j.ejc.2011.03.004","volume":"32","author":"X Zhu","year":"2011","unstructured":"Zhu, X.: The fractional version of Hedetniemi\u2019s conjecture is true. Eur. J. Combin. 32, 1168\u20131175 (2011)","journal-title":"Eur. J. Combin."},{"issue":"3.2","key":"2576_CR13","first-page":"4","volume":"27","author":"X Zhu","year":"2020","unstructured":"Zhu, X.: A note on the Poljak-R\u00f6dl function. Electron. J. Combin. 27(3.2), 4 (2020)","journal-title":"Electron. J. Combin."},{"key":"2576_CR14","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.jctb.2020.09.005","volume":"146","author":"X Zhu","year":"2021","unstructured":"Zhu, X.: Relatively small counterexamples to Hedetniemi\u2019s conjecture. J. Combin. Theory Ser. B 146, 141\u2013150 (2021)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02576-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02576-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02576-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T19:27:24Z","timestamp":1670614044000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02576-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,12]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["2576"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02576-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,10,12]]},"assertion":[{"value":"30 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"171"}}