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