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