Abstract
We show that the inequality
can happen when \(\chi (G\times H) = 43\), improving on the lowest previously known value \(\chi (G\times H) = 125\).
Similar content being viewed by others
Data Availability
Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
Notes
The values 2, 22, 25, 34, 49, 58, 61, 81 were used originally, but here these are multiplied by 38 modulo 83 to simplify the presentation.
References
Burr, S.A., Erdős, P., Lovász, L.: On graphs of Ramsey type. Ars Combinatoria 1, 167–190 (1976)
El-Zahar, M., Sauer, N.: The chromatic number of the product of two \(4\)-chromatic graphs is \(4\). Combinatorica 5, 121–126 (1985)
Gao, G., Zhu, X.: Star-extremal graphs and lexicographic product. Discrete Math. 152, 147–156 (1996)
The GAP Group.: GAP–Groups, algorithms, and programming, Version 4.11.1. (2021). https://www.gap-system.org
Hedetniemi, S.: Homomorphisms of graphs and automata, Technical Report 03105-44-T, University of Michigan. (1966)
Shitov, Y.: Counterexamples to Hedetniemi’s conjecture. Ann. Math. 2(190), 663–667 (2019)
Simonyi, G., Tardos, G.: Local chromatic number. Ky Fan’s Theorem and circular colorings. Combinatorica 26, 587–626 (2006)
Soicher, L.H.: GRAPE, graph algorithms using permutation groups-a refereed GAP package, Version 4.8.5. (2021). (https://gap-packages.github.io/grape)
Tardif, C.: The chromatic number of the product of 14-chromatic graphs can be 13. Combinatorica 42, 301–308 (2022)
Turzík, D.: A note on chromatic number of direct product of graphs. Comment. Math. Univ. Carolin. 24, 461–463 (1983)
Wrochna, M.: Smaller counterexamples to Hedetniemi’s conjecture. (2022). https://arxiv.org/abs/2012.13558 [math.CO]
Zhu, X.: The fractional version of Hedetniemi’s conjecture is true. Eur. J. Combin. 32, 1168–1175 (2011)
Zhu, X.: A note on the Poljak-Rödl function. Electron. J. Combin. 27(3.2), 4 (2020)
Zhu, X.: Relatively small counterexamples to Hedetniemi’s conjecture. J. Combin. Theory Ser. B 146, 141–150 (2021)
Funding
The author declares that no funds, grants, or other support were received during the preparation of this manuscript. The author has no relevant financial or non-financial interests to disclose.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of Interest
The authors have not disclosed any competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Tardif, C. Counterexamples to Hedetniemi’s Conjecture with Large Fractional Chromatic Numbers. Graphs and Combinatorics 38, 171 (2022). https://doi.org/10.1007/s00373-022-02576-x
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00373-022-02576-x