Counterexamples to Hedetniemi's conjecture with large fractional chromatic numbers

DOI10.1007/s00373-022-02576-xzbMath1498.05107OpenAlexW4304692595WikidataQ122923369 ScholiaQ122923369MaRDI QIDQ2084794

Claude Tardif

Publication date: 13 October 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02576-x

zbMATH Keywords

fractional chromatic numbergraph colouringdirect productHedetniemi's conjecture

Mathematics Subject Classification ID

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

Uses Software

• GAP
• GRAPE

Cites Work

• The fractional version of Hedetniemi's conjecture is true
• A note on the Poljak-Rödl function
• Local chromatic number, Ky Fan's theorem, and circular colorings
• The chromatic number of the product of two 4-chromatic graphs is 4
• Star-extremal graphs and the lexicographic product
• The chromatic number of the product of 14-chromatic graphs can be 13
• Relatively small counterexamples to Hedetniemi's conjecture
• Counterexamples to Hedetniemi's conjecture
• Unnamed Item
• Unnamed Item

This page was built for publication: Counterexamples to Hedetniemi's conjecture with large fractional chromatic numbers