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

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

# 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