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