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