### Archives

### Recent blog posts

- A strong form of König’s lemma October 21, 2017
- 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

### Keywords

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

# 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