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