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