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