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