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