Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices

DOI10.14712/1213-7243.2023.003MaRDI QIDQ5878469OpenAlexWikidataFDO

Authors Claude Tardif

Publication date 21 February 2023

Published in Commentationes Mathematicae Universitatis Carolinae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14712/1213-7243.2023.003

zbMATH Keywords

graph colouringHedetniemi's conjecturecategorical product

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Hedetniemi's conjecture and dense Boolean lattices
• Counterexamples to Hedetniemi's conjecture
• Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice
• A note on Boolean lattices of finite posets
• A counterexample to a conjecture of Hutchinson and Lai
• Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza
• An explicit counterexample to the Lagarias-Wang finiteness conjecture
• Proof of a conjecture on partitions of a Boolean lattice
• Relatively small counterexamples to Hedetniemi's conjecture
• On counterexamples to the Hughes conjecture.

Cites work

• scientific article; zbMATH DE number 1054727 (Why is no real title available?)
• A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function
• A note on the Poljak-Rödl function
• A survey on Hedetniemi's conjecture
• Altermatic number of categorical product of graphs
• Counterexamples to Hedetniemi's conjecture
• Graph powers and graph homomorphisms
• Hedetniemi's conjecture and dense Boolean lattices
• Hedetniemi's conjecture is asymptotically false
• Lattices arising in categorial investigations of Hedetniemi's conjecture
• Local chromatic number, Ky Fan's theorem, and circular colorings
• On colorings of graph powers
• On graphs with strongly independent color-classes
• On inverse powers of graphs and topological implications of Hedetniemi's conjecture
• On topological relaxations of chromatic conjectures
• Relatively small counterexamples to Hedetniemi's conjecture
• Sabidussi versus Hedetniemi for three variations of the chromatic number
• The chromatic number of the product of 14-chromatic graphs can be 13
• The chromatic number of the product of two 4-chromatic graphs is 4
• The fractional version of Hedetniemi's conjecture is true
• The level of nonmultiplicativity of graphs

This page was built for publication: Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices

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