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