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