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