### Archives

### Recent blog posts

- Prikry forcing may add a Souslin tree June 12, 2016
- The reflection principle $R_2$ May 20, 2016
- Prolific Souslin trees March 17, 2016
- Genearlizations of Martin’s Axiom and the well-met condition January 11, 2015
- Many diamonds from just one January 6, 2015
- Happy new jewish year! September 24, 2014
- Square principles April 19, 2014
- Partitioning the club guessing January 22, 2014

### Keywords

sap Rock n' Roll 05D10 Uniformization 11P99 square Prikry-type forcing Sakurai's Bell inequality Selective Ultrafilter Jonsson cardinal Hereditarily Lindelöf space Cardinal Invariants Forcing Axioms PFA(S)[S] tensor product graph Fat stationary set Almost-disjoint famiy Chromatic number coloring number diamond star Ascent Path Knaster Microscopic Approach Whitehead Problem Singular coﬁnality Aronszajn tree stationary reflection Rado's conjecture Parameterized proxy principle Successor of Singular Cardinal Coherent tree Non-saturation Universal Sequences Generalized Clubs Minimal Walks Chang's conjecture L-space Rainbow sets reflection principles Hedetniemi's conjecture OCA Prevalent singular cardinals 05A17 Almost Souslin Small forcing middle diamond Singular Density incompactness weak diamond Martin's Axiom P-Ideal Dichotomy 20M14 Successor of Regular Cardinal Kurepa Hypothesis Ostaszewski square b-scale Erdos Cardinal S-Space Stevo Todorcevic polarized partition relation approachability ideal weak square Weakly compact cardinal Mandelbrot set Singular cardinals combinatorics Shelah's Strong Hypothesis very good scale Hindman's Theorem stationary hitting Large Cardinals Commutative cancellative semigroups ccc Poset free Boolean algebra Diamond Singular Cofinality Foundations Axiom R Souslin Tree Dushnik-Miller Constructible Universe xbox Fast club Square-Brackets Partition Relations Erdos-Hajnal graphs PFA Absoluteness Partition Relations Forcing projective Boolean algebra Fodor-type reflection Cohen real HOD Cardinal function Reduced Power Slim tree Antichain Club Guessing Almost countably chromatic

# Tag Archives: Erdos-Hajnal graphs

## 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
11 Comments