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