Hedetniemi's conjecture and adjoint functors in thin categories

DOI10.1007/S10485-017-9484-0zbMATH Open1431.05067arXiv1608.02918OpenAlexW2496759324WikidataQ123197669 ScholiaQ123197669MaRDI QIDQ682072FDOQ682072

Authors: Jan Foniok, Claude Tardif 

Publication date: 13 February 2018

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

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.

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

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

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)

Cites Work

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

Cited In (5)

• Thickness, and a categoric view of type-space functors
• Topology and Adjunction in Promise Constraint Satisfaction
• On inverse powers of graphs and topological implications of Hedetniemi's conjecture
• On an adjoint functor to the Thom functor
• 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)