Archives
Keywords
Mandelbrot set Ineffable cardinal Lipschitz reduction Prikry-type forcing xbox weak diamond diamond star Well-behaved magma coloring number Cohen real stationary hitting Non-saturation Forcing Almost-disjoint family strongly bounded groups specializable Souslin tree weak square Coherent tree Generalized descriptive set theory Chang's conjecture Subnormal ideal Poset projective Boolean algebra very good scale Uniformization full tree Microscopic Approach sap Postprocessing function Hindman's Theorem C-sequence HOD Minimal Walks Strong coloring b-scale Weakly compact cardinal Open Access Rado's conjecture positive partition relation Cardinal Invariants Partition Relations nonmeager set Vanishing levels Nonspecial tree Knaster and friends Entangled linear order indecomposable filter Reduced Power polarized partition relation Fat stationary set Amenable C-sequence Filter reflection perfectly normal Singular cofinality square Precaliber Closed coloring Kurepa Hypothesis Luzin set Rock n' Roll Subtle tree property Subtle cardinal weak Kurepa tree Generalized Clubs Respecting tree GMA Singular Density Local Club Condensation. Ascent Path middle diamond Club Guessing Martin's Axiom Ascending path Almost countably chromatic Foundations Chromatic number Axiom R AIM forcing super-Souslin tree P-Ideal Dichotomy club_AD Fast club SNR Was Ulam right? Greatly Mahlo Ostaszewski square Rainbow sets Sierpinski's onto mapping principle Reflecting stationary set square principles Aronszajn tree PFA Successor of Regular Cardinal tensor product graph Commutative cancellative semigroups Erdos-Hajnal graphs Antichain Uniformly homogeneous Monotonically far ZFC construction Whitehead Problem Hedetniemi's conjecture Souslin Tree Distributive tree Strongly compact cardinal stationary reflection Knaster transformations Singular cardinals combinatorics Countryman line Shelah's Strong Hypothesis higher Baire space ccc S-Space Forcing with side conditions Sigma-Prikry free Boolean algebra Universal Sequences Slim tree Commutative projection system Diamond-sharp Fodor-type reflection approachability ideal Ramsey theory over partitions Absoluteness Large Cardinals Diamond for trees Analytic sets Almost Souslin Forcing Axioms Dushnik-Miller Cardinal function Square-Brackets Partition Relations unbounded function OCA Hereditarily Lindelöf space Iterated forcing countably metacompact Partition relations for trees Jonsson cardinal Erdos Cardinal Selective Ultrafilter Ulam matrix 54G20 O-space Diamond L-space Successor of Singular Cardinal regressive Souslin tree Strongly Luzin set free Souslin tree Small forcing reflection principles Uniformly coherent PFA(S)[S] Dowker space Subadditive Sakurai's Bell inequality Intersection model Interval topology on trees Constructible Universe incompactness Parameterized proxy principle Prevalent singular cardinals stick
Tag Archives: incompactness
11th Young Set Theory Workshop, June 2018
I gave a 4-lecture tutorial at the 11th Young Set Theory Workshop, Lausanne, June 2018. Title: In praise of C-sequences. Abstract. Ulam and Solovay showed that any stationary set may be split into two. Is it also the case that … Continue reading
Posted in Invited Talks
Tagged Aronszajn tree, C-sequence, incompactness, Knaster, Minimal Walks, Postprocessing function, square
Leave a comment
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
Chromatic numbers of graphs – large gaps
Abstract. We say that a graph $G$ is $(\aleph_0,\kappa)$-chromatic if $\text{Chr}(G)=\kappa$, while $\text{Chr}(G’)\le\aleph_0$ for any subgraph $G’$ of $G$ of size $<|G|$. The main result of this paper reads as follows. If $\square_\lambda+\text{CH}_\lambda$ holds for a given uncountable cardinal $\lambda$, … Continue reading
Posted in Compactness, Infinite Graphs, Publications
Tagged 03E35, 05C15, 05C63, Almost countably chromatic, Chromatic number, incompactness, Ostaszewski square
6 Comments
