Archives
Keywords
Antichain transformations countably metacompact polarized partition relation Subadditive Vanishing levels weak diamond positive partition relation Singular Density Universal Sequences Diamond ZFC construction stationary reflection Aronszajn tree tensor product graph Coherent tree weak Kurepa tree Chang's conjecture Postprocessing function Forcing with side conditions Hindman's Theorem Mandelbrot set PFA Reflecting stationary set weak square Prevalent singular cardinals Amenable C-sequence Singular cofinality PFA(S)[S] indecomposable filter Local Club Condensation. Square-Brackets Partition Relations Intersection model Lipschitz reduction Large Cardinals Kurepa Hypothesis Analytic sets Filter reflection very good scale Partition relations for trees Ostaszewski square Ineffable cardinal free Boolean algebra Reduced Power Hereditarily Lindelöf space sap perfectly normal Sierpinski's onto mapping principle Weakly compact cardinal Well-behaved magma club_AD Minimal Walks ccc strongly bounded groups Strongly Luzin set Cardinal Invariants Nonspecial tree O-space Fodor-type reflection Singular cardinals combinatorics Diamond for trees Shelah's Strong Hypothesis Cohen real xbox b-scale Generalized Clubs C-sequence GMA Club Guessing free Souslin tree Small forcing 54G20 Selective Ultrafilter Closed coloring Monotonically far square principles regressive Souslin tree Almost-disjoint family Strongly compact cardinal Ascent Path Absoluteness middle diamond Fat stationary set Whitehead Problem Fast club Ramsey theory over partitions Ascending path Forcing Axioms Sakurai's Bell inequality stationary hitting Commutative projection system Slim tree Uniformly homogeneous Countryman line Knaster and friends Constructible Universe Axiom R incompactness Uniformly coherent S-Space Jonsson cardinal Erdos Cardinal Souslin Tree Was Ulam right? Respecting tree super-Souslin tree Strong coloring Luzin set Interval topology on trees Microscopic Approach Almost Souslin projective Boolean algebra Partition Relations Almost countably chromatic Rado's conjecture Non-saturation Open Access Foundations Rock n' Roll Hedetniemi's conjecture coloring number approachability ideal unbounded function Subtle cardinal nonmeager set Commutative cancellative semigroups Dushnik-Miller AIM forcing SNR Parameterized proxy principle Sigma-Prikry Generalized descriptive set theory Entangled linear order Precaliber Subnormal ideal specializable Souslin tree stick Chromatic number Prikry-type forcing full tree Rainbow sets Successor of Singular Cardinal Poset Dowker space Diamond-sharp Ulam matrix Successor of Regular Cardinal P-Ideal Dichotomy L-space diamond star Martin's Axiom reflection principles Cardinal function Uniformization higher Baire space Erdos-Hajnal graphs Greatly Mahlo Subtle tree property Distributive tree Knaster Iterated forcing OCA Forcing square HOD
Tag Archives: reflection principles
The reflection principle $R_2$
A few years ago, in this paper, I introduced the following reflection principle: Definition. $R_2(\theta,\kappa)$ asserts that for every function $f:E^\theta_{<\kappa}\rightarrow\kappa$, there exists some $j<\kappa$ for which the following set is nonstationary: $$A_j:=\{\delta\in E^\theta_\kappa\mid f^{-1}[j]\cap\delta\text{ is nonstationary}\}.$$ I wrote there … Continue reading
Posted in Blog
Tagged reflection principles, square, stationary reflection, Weakly compact cardinal
Comments Off on The reflection principle $R_2$
The chromatic numbers of the Erdos-Hajnal graphs
Recall that a coloring $c:G\rightarrow\kappa$ of an (undirected) graph $(G,E)$ is said to be chromatic if $c(v_1)\neq c(v_2)$ whenever $\{v_1,v_2\}\in E$. Then, the chromatic number of a graph $(G,E)$ is the least cardinal $\kappa$ for which there exists a chromatic … Continue reading
Posted in Blog, Expository
Tagged Chromatic number, Erdos-Hajnal graphs, Rado's conjecture, reflection principles
14 Comments
