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