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