Abstract
We survey results on Hedetniemi’s conjecture which are connected to adjoint functors in the “thin” category of graphs, and expose the obstacles to extending these results.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Avart, C., Kay, B., Reiher, C., Rödl, V.: The chromatic number of finite type-graphs. J. Combin. Theory Ser. B 122, 877-896 (2017)
Avart, C., Luczak, T., Rödl, V.: On generalized shift graphs. Fund. Math. 226, 173–199 (2014)
Bondy, J.A., Hell, P.: A note on the star chromatic number. J. Graph Theory 14(4), 479–482 (1990)
Dochtermann, A., Schultz, C.: Topology of Hom complexes and test graphs for bounding chromatic number. Israel J. Math. 187(1), 371–417 (2012)
El-Zahar, M., Sauer, N.: The chromatic number of the product of two 4-chromatic graphs is 4. Combinatorica 5(2), 121–126 (1985)
Foniok, J., Nešetril, J., Tardif, C.: Interleaved adjoints of directed graphs. European J. Combin. 32(7), 1018–1024 (2011)
Foniok, J., Tardif, C.: Adjoint functors and tree duality. Discrete Math. Theor. Comput. Sci. 11(2), 97–110 (2009)
Foniok, J., Tardif, C.: Digraph functors which admit both left and right adjoints. Discrete Math. 338(4), 527–535 (2015)
Geller, D., Stahl, S.: The chromatic number and other functions of the lexicographic product. J. Combin. Theory Ser. B 19(1), 87–95 (1975)
Gyárfás, A., Jensen, T.R., Stiebitz, M.: On graphs with strongly independent color-classes. J. Graph Theory 46(1), 1–14 (2004)
Häggkvist, R., Hell, P., Miller, D.J., Lara, V.N.: On multiplicative graphs and the product conjecture. Combinatorica 8(1), 63–74 (1988)
Hajiabolhassan, H.: On colorings of graph powers. Discrete Math. 309(13), 4299–4305 (2009)
Hajiabolhassan, H., Taherkhani, A.: Graph powers and graph homomorphisms. Electron. J. Combin. 17(R17), 16 (2010)
Harner, C.C., Entringer, R.C.: Arc colorings of digraphs. J. Combinatorial Theory Ser. B 13, 219–225 (1972)
Hedetniemi, S.T.: Homomorphisms of graphs and automata, University of Michigan Technical Report 03105-44-T, University of Michigan (1966)
Hell, P., Nešetril, J.: On the complexity of H-coloring. J. Combin. Theory Ser. B 48(1), 92–110 (1990)
Hell, P., Nešetril, J.: Graphs and homomorphisms, Oxford Lecture Series in Mathematics and Its Applications, vol. 28, Oxford University Press (2004)
Imrich, W., Klavžar, S.: Product graphs: Structure and recognition, Wiley Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York (2000)
Lovász, L.: Kneser’s conjecture, chromatic number and homotopy. J. Combin. Theory Ser. A 25(3), 319–324 (1978)
Poljak, S.: Coloring digraphs by iterated antichains. Comment. Math. Univ. Carolin. 32(2), 209–212 (1991)
Poljak, S., Rödl, V.: On the arc-chromatic number of a digraph. J. Combin. Theory Ser. B 31(2), 190–198 (1981)
Pultr, A.: The right adjoints into the categories of relational systems, Reports of the Midwest Category Seminar, IV (Berlin), Lecture Notes in Mathematics, vol. 137, Springer, pp. 100–113 (1970)
Tardif, C.: Multiplicative graphs and semi-lattice endomorphisms in the category of graphs. J. Combin. Theory Ser. B 95(2), 338–345 (2005)
Tardif, C., Wehlau, D.: Chromatic numbers of products of graphs: the directed and undirected versions of the Poljak–Rödl function. J. Graph Theory 51(1), 33–36 (2006)
Tardif, C., Zhu, X.: On Hedetniemi’s conjecture and the colour template scheme. Discrete Math. 253, 77–85 (2002)
Wrochna, M.: Square-free graphs are multiplicative. J. Combin. Theory Ser. B 122, 479–507 (2017)
Zhu, X.: Circular chromatic number: a survey. Discrete Math. 229, 371–410 (2001)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Foniok, J., Tardif, C. Hedetniemi’s Conjecture and Adjoint Functors in Thin Categories. Appl Categor Struct 26, 113–128 (2018). https://doi.org/10.1007/s10485-017-9484-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10485-017-9484-0