### Archives

### Recent blog posts

- Prikry forcing may add a Souslin tree June 12, 2016
- The reflection principle $R_2$ May 20, 2016
- Prolific Souslin trees March 17, 2016
- Generalizations of Martin’s Axiom and the well-met condition January 11, 2015
- Many diamonds from just one January 6, 2015
- Happy new jewish year! September 24, 2014
- Square principles April 19, 2014
- Partitioning the club guessing January 22, 2014

### Keywords

Weakly compact cardinal Slim tree Jonsson cardinal Generalized Clubs Selective Ultrafilter xbox b-scale Club Guessing Cardinal Invariants Almost countably chromatic PFA(S)[S] Shelah's Strong Hypothesis weak diamond Singular cardinals combinatorics 05D10 approachability ideal Parameterized proxy principle P-Ideal Dichotomy Prevalent singular cardinals Uniformization Aronszajn tree Hereditarily Lindelöf space very good scale Commutative cancellative semigroups Almost-disjoint famiy 11P99 Forcing Axioms Souslin Tree Fodor-type reflection Rado's conjecture Non-saturation Singular Cofinality free Boolean algebra 20M14 coloring number Kurepa Hypothesis Partition Relations Fat stationary set projective Boolean algebra Diamond Whitehead Problem Ascent Path Minimal Walks Successor of Singular Cardinal Small forcing Large Cardinals Dushnik-Miller Constructible Universe incompactness Chromatic number Sakurai's Bell inequality Successor of Regular Cardinal S-Space Rock n' Roll Erdos Cardinal Coherent tree tensor product graph Chang's conjecture PFA OCA square Martin's Axiom Universal Sequences stationary reflection Mandelbrot set Forcing Axiom R polarized partition relation Rainbow sets Stevo Todorcevic Absoluteness Cardinal function Hedetniemi's conjecture HOD Knaster Foundations Cohen real Microscopic Approach Reduced Power ccc Ostaszewski square middle diamond Poset sap Hindman's Theorem weak square stationary hitting L-space Singular Density diamond star Erdos-Hajnal graphs Almost Souslin 05A17 Square-Brackets Partition Relations Singular coﬁnality Prikry-type forcing Antichain reflection principles Fast club

# Tag Archives: Hedetniemi’s conjecture

## Hedetniemi’s conjecture for uncountable graphs

Abstract. It is proved that in Godel’s constructible universe, for every successor cardinal $\kappa$, there exist graphs $\mathcal G$ and $\mathcal H$ of size and chromatic number $\kappa$, for which the tensor product graph $\mathcal G\times\mathcal H$ is countably chromatic. … Continue reading

## 2013 Set Theory Programme on Large Cardinals and Forcing

I gave an invited talk at the Large Cardinals and Forcing meeting, Erwin Schrödinger International Institute for Mathematical Physics, Vienna, September 23–27, 2013. Talk Title: Hedetniemi’s conjecture for uncountable graphs Abstract: It is proved that in Godel’s constructible universe, for … Continue reading

Posted in Invited Talks
Tagged Almost countably chromatic, Chromatic number, Hedetniemi's conjecture
1 Comment