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