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

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

# 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