A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function

zbMath1428.05119arXiv1906.03748MaRDI QIDQ2278108

Claude Tardif, Xuding Zhu

Publication date: 9 December 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (9)

In praise of homomorphisms ⋮ The chromatic number of the product of 14-chromatic graphs can be 13 ⋮ Shannon capacity and the categorical product ⋮ On multichromatic numbers of widely colorable graphs ⋮ Relatively small counterexamples to Hedetniemi's conjecture ⋮ Hedetniemi's conjecture is asymptotically false ⋮ Note on Hedetniemi's conjecture and the Poljak-Rödl function ⋮ A note on the Poljak-Rödl function ⋮ Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices

Cites Work

• Unnamed Item
• The fractional version of Hedetniemi's conjecture is true
• Kneser's conjecture, chromatic number, and homotopy
• The chromatic number of the product of two 4-chromatic graphs is 4
• n-tuple colorings and associated graphs
• A survey on Hedetniemi's conjecture
• Star-extremal graphs and the lexicographic product
• Coloring graph products---a survey
• Counterexamples to Hedetniemi's conjecture
• Graph Theory and Probability
• Bounding Ramsey numbers through large deviation inequalities
• Hedetniemi's conjecture---a survey

This page was built for publication: A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function