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