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

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

# 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