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