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