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