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