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