Hedetniemi's conjecture for uncountable graphs

DOI10.4171/JEMS/666zbMath1423.03238arXiv1307.6841OpenAlexW2964274373WikidataQ123252471 ScholiaQ123252471MaRDI QIDQ509108

Assaf Rinot

Publication date: 8 February 2017

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

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

zbMATH Keywords

product graphHedetniemi's conjectureconstructible universealmost countably chromaticincompactnessOstaszewski square

Mathematics Subject Classification ID

Consistency and independence results (03E35) Coloring of graphs and hypergraphs (05C15) Applications of set theory (03E75) Other combinatorial set theory (03E05) Infinite graphs (05C63)

Related Items (3)

SQUARE WITH BUILT-IN DIAMOND-PLUS ⋮ Counterexamples to Hedetniemi's conjecture ⋮ Putting a diamond inside the square

Cites Work

• Chromatic numbers of graphs -- large gaps
• The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable
• Whitehead groups may not be free even assuming CH. II
• On the arc-chromatic number of a digraph
• A \({\Delta{}}^ 2_ 2\) well-order of the reals and incompactness of \(L(Q^{MM})\)
• Whitehead groups may be not free, even assuming CH. I
• The Ostaszewski square and homogeneous Souslin trees
• Same graph, different universe
• Some results on higher Suslin trees
• Generic graph construction
• Squares with diamonds and Souslin trees with special squares
• A Note on the Combinatorial Principles ◊(E)
• A new construction of non-constructible ${Δ^1}_3$ subset of ω
• Putting a diamond inside the square
• On chromatic number of graphs and set-systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hedetniemi's conjecture for uncountable graphs