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