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