Archives
Keywords
Uniformly homogeneous Martin's Axiom Souslin Tree Almost-disjoint family Precaliber C-sequence middle diamond 54G20 Vanishing levels Square-Brackets Partition Relations Amenable C-sequence b-scale PFA sap weak Kurepa tree Cardinal function Shelah's Strong Hypothesis unbounded function Sakurai's Bell inequality ZFC construction Commutative cancellative semigroups Axiom R Diamond-sharp Aronszajn tree Fast club Microscopic Approach Foundations HOD S-Space Whitehead Problem Commutative projection system Diamond Strongly compact cardinal Respecting tree approachability ideal Knaster and friends Strongly Luzin set projective Boolean algebra indecomposable ultrafilter polarized partition relation Hedetniemi's conjecture Fodor-type reflection Countryman line Ulam matrix diamond star Closed coloring Coherent tree Cohen real Generalized descriptive set theory stationary hitting Luzin set Ineffable cardinal Small forcing higher Baire space Rainbow sets Chang's conjecture Kurepa Hypothesis Jonsson cardinal square principles Subtle cardinal Universal Sequences square Uniformization tensor product graph Partition Relations Iterated forcing Prikry-type forcing Ramsey theory over partitions Prevalent singular cardinals stationary reflection Analytic sets Minimal Walks club_AD AIM forcing Successor of Singular Cardinal Constructible Universe Sigma-Prikry OCA reflection principles free Boolean algebra regressive Souslin tree Was Ulam right? Intersection model nonmeager set incompactness Lipschitz reduction Large Cardinals Greatly Mahlo Dushnik-Miller Singular cofinality weak square coloring number countably metacompact Weakly compact cardinal Fat stationary set Diamond for trees Hereditarily Lindelöf space Forcing Axioms Poset Non-saturation super-Souslin tree Ascent Path Absoluteness Mandelbrot set Ostaszewski square P-Ideal Dichotomy Well-behaved magma Forcing PFA(S)[S] Rado's conjecture Strong coloring xbox Subadditive Selective Ultrafilter Hindman's Theorem Parameterized proxy principle Erdos Cardinal Knaster Subtle tree property free Souslin tree L-space Sierpinski's onto mapping principle Almost countably chromatic SNR full tree Erdos-Hajnal graphs Successor of Regular Cardinal positive partition relation Singular Density Club Guessing Distributive tree specializable Souslin tree weak diamond Generalized Clubs very good scale O-space Singular cardinals combinatorics Slim tree ccc Rock n' Roll Reduced Power Reflecting stationary set Open Access Uniformly coherent Dowker space transformations Nonspecial tree Antichain Cardinal Invariants GMA Postprocessing function Filter reflection Local Club Condensation. Subnormal ideal stick Almost Souslin strongly bounded groups Chromatic number
Tag Archives: Rado’s conjecture
Reflection on the coloring and chromatic numbers
Joint work with Chris Lambie-Hanson. Abstract. We prove that reflection of the coloring number of graphs is consistent with non-reflection of the chromatic number. Moreover, it is proved that incompactness for the chromatic number of graphs (with arbitrarily large gaps) … Continue reading
Posted in Compactness, Infinite Graphs, Publications
Tagged 03E35, 05C15, 05C63, Chang's conjecture, Chromatic number, coloring number, Fodor-type reflection, incompactness, Iterated forcing, Parameterized proxy principle, Postprocessing function, Rado's conjecture, square, stationary reflection
2 Comments
Square principles
Since the birth of Jensen’s original Square principle, many variations of the principle were introduced and intensively studied. Asaf Karagila suggested me today to put some order into all of these principles. Here is a trial. Definition. A square principle … Continue reading
The chromatic numbers of the Erdos-Hajnal graphs
Recall that a coloring
Posted in Blog, Expository
Tagged Chromatic number, Erdos-Hajnal graphs, Rado's conjecture, reflection principles
13 Comments
