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