Archives
Keywords
countably metacompact nonmeager set Fodor-type reflection approachability ideal O-space C-sequence Well-behaved magma Mandelbrot set Hereditarily Lindelöf space Square-Brackets Partition Relations Strongly Luzin set Knaster Sierpinski's onto mapping principle weak diamond Poset Greatly Mahlo indecomposable filter Reflecting stationary set diamond star Uniformly homogeneous Singular cardinals combinatorics Erdos-Hajnal graphs stationary reflection specializable Souslin tree 54G20 Successor of Singular Cardinal Ascent Path Selective Ultrafilter Jonsson cardinal Commutative projection system transformations Strong coloring coloring number Club Guessing higher Baire space Almost Souslin stationary hitting Ascending path Postprocessing function Amenable C-sequence Whitehead Problem Knaster and friends Local Club Condensation. Lipschitz reduction AIM forcing Analytic sets perfectly normal Minimal Walks Forcing Axioms positive partition relation full tree Ineffable cardinal club_AD Luzin set Diamond for trees L-space Antichain free Souslin tree Hedetniemi's conjecture Absoluteness Rock n' Roll middle diamond Cohen real Interval topology on trees free Boolean algebra square SNR square principles Axiom R stick Universal Sequences Successor of Regular Cardinal Microscopic Approach Almost countably chromatic Hindman's Theorem Generalized descriptive set theory Kurepa Hypothesis Dushnik-Miller Iterated forcing Prevalent singular cardinals Countryman line Non-saturation Subnormal ideal Diamond-sharp Forcing with side conditions Dowker space Uniformization Ramsey theory over partitions Distributive tree Vanishing levels Open Access Respecting tree Uniformly coherent Rado's conjecture super-Souslin tree Subtle cardinal incompactness PFA(S)[S] Generalized Clubs Aronszajn tree weak square PFA Sakurai's Bell inequality projective Boolean algebra unbounded function Constructible Universe polarized partition relation Partition relations for trees Chromatic number Martin's Axiom ZFC construction Subtle tree property GMA ccc Cardinal Invariants Diamond Rainbow sets Fast club Forcing Slim tree Was Ulam right? Weakly compact cardinal Erdos Cardinal Prikry-type forcing OCA Monotonically far HOD Nonspecial tree Singular Density Almost-disjoint family Shelah's Strong Hypothesis regressive Souslin tree strongly bounded groups Souslin Tree Closed coloring Partition Relations Coherent tree Cardinal function Parameterized proxy principle Chang's conjecture Fat stationary set Ostaszewski square weak Kurepa tree Ulam matrix Foundations Strongly compact cardinal Sigma-Prikry b-scale Entangled linear order S-Space tensor product graph Subadditive xbox Large Cardinals Commutative cancellative semigroups P-Ideal Dichotomy reflection principles Filter reflection Singular cofinality sap Small forcing Reduced Power Intersection model Precaliber very good scale
Tag Archives: Rainbow sets
Prolific Souslin trees
In a paper from 1971, Erdos and Hajnal asked whether (assuming CH) every coloring witnessing $\aleph_1\nrightarrow[\aleph_1]^2_3$ has a rainbow triangle. The negative solution was given in a 1975 paper by Shelah, and the proof and relevant definitions may be found … Continue reading
Posted in Blog, Expository
Tagged Rainbow sets, Souslin Tree, Square-Brackets Partition Relations
Leave a comment
Polychromatic colorings
These are lectures notes of two talks Dani Livne gave in our Infinite Combinatorics seminar. I did not take notes in real-time, hence, all possible mistakes here are due to myself. Recall that a function $f:A\rightarrow B$ is said to … Continue reading
Comparing rectangles with squares through rainbow sets
In Todorcevic’s class last week, he proved all the results of Chapter 8 from his Walks on Ordinals book, up to (and including) Theorem 8.1.11. The upshots are as follows: Every regular infinite cardinal $\theta$ admits a naturally defined function … Continue reading
