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