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

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

# 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