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