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