Hedetniemi's conjecture and adjoint functors in thin categories

DOI10.1007/S10485-017-9484-0MaRDI QIDQ682072zbMATH OpenOpenAlexWikidataFDO

Authors Jan Foniok, Claude Tardif

Publication date 13 February 2018

Published in Applied Categorical Structures (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1608.02918

zbMATH Keywords

chromatic numbergraph productsadjoint functors

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76) Preorders, orders, domains and lattices (viewed as categories) (18B35)

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.

Recommendations

• Adjoint functor theorems for homotopically enriched categories
• Adjoint functor theorems for \(\infty\)-categories
• Adjoint Functors and Triangulated Categories
• Contravariantly finite subcategories and adjunctions
• Some adjoints in homotopy categories
• Applications of hyperhomology to adjoint functors
• An embedding theorem for adhesive categories
• scientific article; zbMATH DE number 797056
• Adjoint functors and equivalences of subcategories
• On an adjoint functor to the Thom functor

Cites work

• scientific article; zbMATH DE number 37867 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• A note on the star chromatic number
• Adjoint functors and tree duality
• Arc colorings of digraphs
• Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function
• Circular chromatic number: A survey
• Digraph functors which admit both left and right adjoints
• Graph powers and graph homomorphisms
• Interleaved adjoints of directed graphs
• Kneser's conjecture, chromatic number, and homotopy
• Multiplicative graphs and semi-lattice endomorphisms in the category of graphs
• On Hedetniemi's conjecture and the colour template scheme
• On colorings of graph powers
• On generalized shift graphs
• On graphs with strongly independent color-classes
• On multiplicative graphs and the product conjecture
• On the arc-chromatic number of a digraph
• On the complexity of H-coloring
• Square-free graphs are multiplicative
• The chromatic number and other functions of the lexicographic product
• The chromatic number of finite type-graphs
• The chromatic number of the product of two 4-chromatic graphs is 4
• The right adjoints into the categories of relational systems
• Topology of Hom complexes and test graphs for bounding chromatic number

Cited in

(5)

• Thickness, and a categoric view of type-space functors
• Topology and Adjunction in Promise Constraint Satisfaction
• On an adjoint functor to the Thom functor
• On inverse powers of graphs and topological implications of Hedetniemi's conjecture
• Hedetniemi's conjecture and strongly multiplicative graphs

This page was built for publication: Hedetniemi's conjecture and adjoint functors in thin categories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q682072)