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