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