Lattices arising in categorial investigations of Hedetniemi's conjecture

DOI10.1016/0012-365X(94)00298-WzbMath0853.06006OpenAlexW2008149288WikidataQ56389107 ScholiaQ56389107MaRDI QIDQ1917488

Dwight Duffus, Norbert W. Sauer

Publication date: 7 July 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00298-w

zbMATH Keywords

productBoolean latticedistributive latticepseudocomplementationHedetniemi conjecturecategories of relational structuresmultiplicative structures in categoriesrelational structures over a unary languageskeleton of a category

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Pseudocomplemented lattices (06D15) Preorders, orders, domains and lattices (viewed as categories) (18B35) Relational systems, laws of composition (08A02)

Related Items

Compactness and finite equivalence of infinite digraphs, Square-free graphs are multiplicative, Hedetniemi's conjecture and dense Boolean lattices, On the General Coloring Problem, Chromatic numbers and products, Duality theorems for finite structures (characterising gaps and good characterisations), Density via duality., Circular colouring and graph homomorphism, Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph multiplication
• The chromatic number of the product of two 4-chromatic graphs is 4
• The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable
• On multiplicative graphs and the product conjecture
• On the arc-chromatic number of a digraph
• Color-families are dense
• An algebraic approach to non-classical logics
• Homomorphisms to oriented cycles
• Generalized arithmetic
• On the chromatic number of the product of graphs
• An approach to hedetniemi's conjecture
• Colimits in Topoi
• The Categorical Product of Graphs
• Operations with structures