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