Hedetniemi's conjecture for uncountable graphs

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


It is proved that in Godel's constructible universe, for every infinite successor cardinal, there exist graphs G and H of size and chromatic number, for which the product graph G × H is countably chromatic.

Original languageEnglish
Pages (from-to)285-298
Number of pages14
JournalJournal of the European Mathematical Society
Issue number1
StatePublished - 2017

Bibliographical note

Publisher Copyright:
© 2017 European Mathematical Society.


  • Almost countably chromatic
  • Constructible universe
  • Hedetniemi's conjecture
  • Incompactness
  • Ostaszewski square
  • Product graph


Dive into the research topics of 'Hedetniemi's conjecture for uncountable graphs'. Together they form a unique fingerprint.

Cite this