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

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

# 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