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