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