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