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