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