𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hedetniemi’s Conjecture and Dense Boolean Lattices

✍ Scribed by Claude Tardif

Publisher
Springer Netherlands
Year
2010
Tongue
English
Weight
308 KB
Volume
28
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lattices arising in categorial investiga
Lattices arising in categorial investigations of Hedetniemi's conjecture
✍ Dwight Duffus; Norbert Sauer 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 844 KB

We discuss Hedetniemi's conjecture in the context of categories of relational structures under homomorphisms. In this language Hedetniemi's conjecture says that if there are no homomorphisms from the graphs G and H to the complete graph on n vertices then there is no homomorphism from G x H to the c

An approach to hedetniemi's conjecture
An approach to hedetniemi's conjecture
✍ N. W. Sauer; X. Zhu 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 717 KB

## Abstract For a fixed integer __n__ ϵ ω, a graph __G__ of chromatic number greater than __n__ is called persistent if for all __n__ + 1‐chromatic graphs __H__, the products __G__ × __H__ are __n__ + 1‐chromatic graphs. Wheter all graphs of chromatic number greater than __n__ are persistent is a l