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