Archives
Keywords
PFA(S)[S] Analytic sets Cohen real Selective Ultrafilter Rainbow sets diamond star Ulam matrix SNR Shelah's Strong Hypothesis Rock n' Roll PFA Weakly compact cardinal Ineffable cardinal Strongly Luzin set Parameterized proxy principle weak diamond Large Cardinals Forcing Axioms strongly bounded groups Generalized Clubs Strong coloring Martin's Axiom b-scale Cardinal function Amenable C-sequence Dowker space Greatly Mahlo Constructible Universe Erdos-Hajnal graphs Uniformly homogeneous Ramsey theory over partitions Dushnik-Miller Kurepa Hypothesis Sierpinski's onto mapping principle Antichain Generalized descriptive set theory weak square 54G20 positive partition relation Coherent tree OCA Commutative cancellative semigroups free Souslin tree Chromatic number regressive Souslin tree Aronszajn tree Mandelbrot set O-space sap Distributive tree Luzin set free Boolean algebra Almost countably chromatic higher Baire space Postprocessing function coloring number super-Souslin tree Open Access Uniformly coherent C-sequence Reduced Power Local Club Condensation. Was Ulam right Lipschitz reduction Forcing Axiom R Diamond for trees nonmeager set transformations Poset Souslin Tree Subnormal ideal Small forcing Absoluteness Slim tree specializable Souslin tree Sigma-Prikry Vanishing levels Knaster and friends full tree Erdos Cardinal Club Guessing Subtle cardinal Fodor-type reflection Diamond Reflecting stationary set very good scale reflection principles Non-saturation Precaliber AIM forcing ZFC construction Almost Souslin projective Boolean algebra middle diamond Chang's conjecture Sakurai's Bell inequality Iterated forcing Minimal Walks approachability ideal indecomposable ultrafilter Singular Density Filter reflection Hindman's Theorem stationary reflection square principles Whitehead Problem Subadditive GMA Nonspecial tree weak Kurepa tree square Diamond-sharp Closed coloring Foundations L-space Fast club Almost-disjoint family Successor of Singular Cardinal Square-Brackets Partition Relations Successor of Regular Cardinal Subtle tree property countably metacompact S-Space Hedetniemi's conjecture Rado's conjecture P-Ideal Dichotomy unbounded function Cardinal Invariants Singular cofinality Microscopic Approach Hereditarily Lindelöf space xbox Singular cardinals combinatorics tensor product graph Ascent Path Partition Relations Fat stationary set HOD ccc incompactness polarized partition relation Universal Sequences Jonsson cardinal stick Knaster stationary hitting club_AD Prevalent singular cardinals Uniformization Well-behaved magma Prikry-type forcing Ostaszewski square
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