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