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