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