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