### 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

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

# 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

## Set Theory Programme on Large Cardinals and Forcing, September 2013

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