Archives
Keywords
transformations Martin's Axiom Forcing Axioms Prevalent singular cardinals Sakurai's Bell inequality AIM forcing square unbounded function Interval topology on trees PFA(S)[S] Coherent tree Subtle tree property Uniformly homogeneous S-Space Singular cofinality Commutative cancellative semigroups Uniformization Reduced Power Prikry-type forcing Weakly compact cardinal Diamond for trees Diamond Large Cardinals Cardinal function Foundations weak diamond Parameterized proxy principle Square-Brackets Partition Relations Dowker space Chromatic number Distributive tree approachability ideal positive partition relation Successor of Singular Cardinal Club Guessing C-sequence L-space Hindman's Theorem Fodor-type reflection Generalized Clubs Partition relations for trees Generalized descriptive set theory Was Ulam right? Successor of Regular Cardinal Knaster very good scale Forcing Almost countably chromatic b-scale Ineffable cardinal Luzin set Singular Density Almost-disjoint family Microscopic Approach Cardinal Invariants weak square Sigma-Prikry Poset Singular cardinals combinatorics Hereditarily Lindelöf space Aronszajn tree Partition Relations higher Baire space weak Kurepa tree Almost Souslin Chang's conjecture Nonspecial tree sap xbox Constructible Universe P-Ideal Dichotomy Universal Sequences Strongly Luzin set Fat stationary set free Souslin tree Rado's conjecture stationary hitting Jonsson cardinal Uniformly coherent indecomposable filter projective Boolean algebra Small forcing Open Access Precaliber regressive Souslin tree strongly bounded groups Erdos-Hajnal graphs Minimal Walks middle diamond Amenable C-sequence diamond star Non-saturation Monotonically far Commutative projection system specializable Souslin tree Reflecting stationary set stationary reflection Erdos Cardinal Ramsey theory over partitions Cohen real Entangled linear order OCA super-Souslin tree Lipschitz reduction Ulam matrix Selective Ultrafilter Absoluteness Ascent Path stick Well-behaved magma Postprocessing function Respecting tree O-space Subadditive club_AD Strongly compact cardinal Ostaszewski square Mandelbrot set HOD Souslin Tree Subnormal ideal Rock n' Roll Dushnik-Miller Strong coloring Fast club Antichain Greatly Mahlo Rainbow sets Shelah's Strong Hypothesis Ascending path Kurepa Hypothesis tensor product graph coloring number GMA Vanishing levels Local Club Condensation. SNR incompactness Subtle cardinal Diamond-sharp Closed coloring Slim tree Countryman line reflection principles Intersection model full tree square principles Iterated forcing polarized partition relation Analytic sets Forcing with side conditions PFA Whitehead Problem Filter reflection ZFC construction 54G20 free Boolean algebra nonmeager set countably metacompact Knaster and friends Axiom R perfectly normal Sierpinski's onto mapping principle Hedetniemi's conjecture ccc
Tag Archives: Ostaszewski square
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
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
Chromatic numbers of graphs – large gaps
Abstract. We say that a graph $G$ is $(\aleph_0,\kappa)$-chromatic if $\text{Chr}(G)=\kappa$, while $\text{Chr}(G’)\le\aleph_0$ for any subgraph $G’$ of $G$ of size $<|G|$. The main result of this paper reads as follows. If $\square_\lambda+\text{CH}_\lambda$ holds for a given uncountable cardinal $\lambda$, … Continue reading
Posted in Compactness, Infinite Graphs, Publications
Tagged 03E35, 05C15, 05C63, Almost countably chromatic, Chromatic number, incompactness, Ostaszewski square
6 Comments
The Ostaszewski square, and homogeneous Souslin trees
Abstract: Assume GCH and let $\lambda$ denote an uncountable cardinal. We prove that if $\square_\lambda$ holds, then this may be witnessed by a coherent sequence $\left\langle C_\alpha \mid \alpha<\lambda^+\right\rangle$ with the following remarkable guessing property: For every sequence $\langle A_i\mid i<\lambda\rangle$ … Continue reading
Posted in Publications, Souslin Hypothesis, Squares and Diamonds
Tagged 03E05, 03E35, Club Guessing, Fat stationary set, Ostaszewski square, Souslin Tree
5 Comments
