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