Archives
Keywords
Aronszajn tree Interval topology on trees Subtle tree property Knaster and friends ZFC construction PFA(S)[S] Ostaszewski square Postprocessing function Forcing Axioms AIM forcing xbox Souslin Tree coloring number higher Baire space Commutative cancellative semigroups Erdos Cardinal Subadditive Kurepa Hypothesis Foundations Club Guessing Almost countably chromatic Successor of Regular Cardinal OCA positive partition relation Ascent Path stationary reflection PFA Forcing with side conditions Fodor-type reflection Ineffable cardinal Fast club Singular Density Sakurai's Bell inequality Minimal Walks Vanishing levels countably metacompact Open Access Knaster Uniformization square principles Coherent tree Martin's Axiom Partition relations for trees Distributive tree middle diamond Partition Relations nonmeager set Local Club Condensation. P-Ideal Dichotomy diamond star Microscopic Approach club_AD Lipschitz reduction Was Ulam right? Subtle cardinal Hedetniemi's conjecture Shelah's Strong Hypothesis Selective Ultrafilter incompactness Almost-disjoint family Well-behaved magma Poset Commutative projection system regressive Souslin tree transformations weak Kurepa tree Chang's conjecture Dushnik-Miller super-Souslin tree Amenable C-sequence Square-Brackets Partition Relations Sierpinski's onto mapping principle GMA Slim tree Precaliber Prikry-type forcing sap weak square b-scale Filter reflection Greatly Mahlo Parameterized proxy principle Analytic sets Countryman line Forcing Erdos-Hajnal graphs reflection principles Reduced Power weak diamond very good scale projective Boolean algebra Monotonically far Ulam matrix indecomposable filter Cardinal Invariants Ramsey theory over partitions stick Diamond-sharp Small forcing Rock n' Roll O-space Almost Souslin Uniformly coherent Nonspecial tree Closed coloring L-space Subnormal ideal S-Space Weakly compact cardinal Jonsson cardinal Sigma-Prikry Intersection model unbounded function stationary hitting Strongly compact cardinal Luzin set Large Cardinals 54G20 Hindman's Theorem Generalized descriptive set theory Axiom R C-sequence HOD free Boolean algebra Diamond for trees strongly bounded groups Generalized Clubs Absoluteness full tree Chromatic number SNR polarized partition relation Respecting tree Cohen real Antichain ccc Prevalent singular cardinals Hereditarily Lindelöf space free Souslin tree Universal Sequences Uniformly homogeneous Dowker space tensor product graph Fat stationary set perfectly normal approachability ideal Reflecting stationary set Singular cofinality Mandelbrot set square Iterated forcing Rainbow sets Whitehead Problem specializable Souslin tree Ascending path Constructible Universe Diamond Rado's conjecture Successor of Singular Cardinal Strongly Luzin set Strong coloring Entangled linear order Non-saturation Cardinal function Singular cardinals combinatorics
Tag Archives: Constructible Universe
Same Graph, Different Universe
Abstract. May the same graph admit two different chromatic numbers in two different universes? how about infinitely many different values? and can this be achieved without changing the cardinals structure? In this paper, it is proved that in Godel’s constructible … Continue reading
Posted in Infinite Graphs, Publications
Tagged 03E35, 05C15, 05C63, approachability ideal, Chromatic number, Constructible Universe, Forcing, Ostaszewski square
10 Comments
INFTY Final Conference, March 2014
I gave an invited talk at the INFTY Final Conference meeting, Bonn, March 4-7, 2014. [Curiosity: Georg Cantor was born March 3, 1845] Title: Same Graph, Different Universe. Abstract: In a paper from 1998, answering a question of Hajnal, Soukup … Continue reading
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
