### 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
- Generalizations 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

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

# 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