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