Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices

DOI10.14712/1213-7243.2023.003OpenAlexW4320725624WikidataQ123000826 ScholiaQ123000826MaRDI QIDQ5878469

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)

Cites Work

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

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