A note on the Poljak-Rödl function

DOI10.37236/9371zbMath1444.05059OpenAlexW3041841646MaRDI QIDQ782938

Xuding Zhu

Publication date: 29 July 2020

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

Full work available at URL: https://doi.org/10.37236/9371

zbMATH Keywords

tensor productcategorical productexponential graph

Mathematics Subject Classification ID

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

Related Items (6)

The chromatic number of the product of 14-chromatic graphs can be 13 ⋮ Shannon capacity and the categorical product ⋮ Relatively small counterexamples to Hedetniemi's conjecture ⋮ Note on Hedetniemi's conjecture and the Poljak-Rödl function ⋮ Counterexamples to Hedetniemi's conjecture with large fractional chromatic numbers ⋮ 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
• Coloring graph products---a survey
• Counterexamples to Hedetniemi's conjecture
• A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function
• Hedetniemi's conjecture---a survey

This page was built for publication: A note on the Poljak-Rödl function