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