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