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