Archives
Keywords
Erdos-Hajnal graphs Dushnik-Miller unbounded function Forcing Axioms strongly bounded groups super-Souslin tree Subtle cardinal Cardinal Invariants Strongly Luzin set Fat stationary set free Boolean algebra Precaliber weak Kurepa tree Analytic sets Strongly compact cardinal Intersection model 54G20 very good scale Mandelbrot set Strong coloring ccc Countryman line Interval topology on trees Cardinal function Club Guessing Singular cofinality weak square nonmeager set Knaster and friends Knaster specializable Souslin tree incompactness Lipschitz reduction ZFC construction Partition relations for trees positive partition relation Iterated forcing Foundations sap P-Ideal Dichotomy club_AD Kurepa Hypothesis Ascending path Chromatic number Rainbow sets Uniformization approachability ideal polarized partition relation Closed coloring Commutative cancellative semigroups Non-saturation indecomposable filter Sigma-Prikry Constructible Universe Prevalent singular cardinals OCA Diamond-sharp Ascent Path Poset countably metacompact AIM forcing Respecting tree b-scale Luzin set Slim tree Successor of Regular Cardinal transformations Forcing Uniformly coherent Universal Sequences coloring number Partition Relations Successor of Singular Cardinal Entangled linear order Hedetniemi's conjecture Singular cardinals combinatorics Almost countably chromatic Erdos Cardinal Commutative projection system Diamond for trees PFA(S)[S] Almost Souslin Ulam matrix Parameterized proxy principle weak diamond Small forcing Nonspecial tree Prikry-type forcing Diamond Hindman's Theorem Jonsson cardinal Coherent tree S-Space square principles Large Cardinals Ramsey theory over partitions Well-behaved magma Vanishing levels Ostaszewski square Was Ulam right? Rado's conjecture stick Shelah's Strong Hypothesis Absoluteness Reflecting stationary set SNR square Axiom R Aronszajn tree Generalized Clubs Postprocessing function Fast club Generalized descriptive set theory stationary reflection reflection principles Sierpinski's onto mapping principle Sakurai's Bell inequality middle diamond Whitehead Problem projective Boolean algebra Hereditarily Lindelöf space Square-Brackets Partition Relations Antichain xbox Selective Ultrafilter Weakly compact cardinal tensor product graph perfectly normal Dowker space Minimal Walks Microscopic Approach C-sequence Cohen real diamond star full tree Almost-disjoint family stationary hitting Reduced Power higher Baire space GMA Forcing with side conditions PFA Uniformly homogeneous O-space HOD Martin's Axiom Souslin Tree Subnormal ideal Open Access regressive Souslin tree Local Club Condensation. Subadditive Ineffable cardinal Amenable C-sequence Distributive tree Filter reflection Chang's conjecture Fodor-type reflection Monotonically far L-space Subtle tree property Rock n' Roll Greatly Mahlo Singular Density free Souslin 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
14 Comments
