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