Related papers: More on Compactness of Chromatic Numbers
We continue the study from \cite{BrendleFreidmanMontoya, vandervlugtlocalizationcardinals} of localization cardinals $\mfb_\kappa(\in^*)$ and $\mfd_\kappa(\in^*)$ and their variants at regular uncountable $\kappa$. We prove that if $\kappa$…
In [8] the second and third authors showed that if the least inaccessible cardinal is the least measurable cardinal, then there is an inner model with $o(\kappa)\geq2$. In this paper we improve this to $o(\kappa)\geq\kappa+1$ and show that…
Our purpose is to show that complements of line graphs enjoy nice coloring properties. We show that for all graphs in this class the local and usual chromatic numbers are equal. We also prove a sufficient condition for the chromatic number…
We prove that some natural "outside" property is equivalent (for a first order class) to being stable. For a model, being resplendent is a strengthening of being kappa-saturated. Restricting ourselves to the case kappa > |T| for…
We continue our study of strongly unbounded colorings, this time focusing on subadditive maps. In Part I of this series, we showed that, for many pairs of infinite cardinals $\theta<\kappa$, the existence of a strongly unbounded coloring…
The pinning down number $ {pd}(X)$ of a topological space $X$ is the smallest cardinal $\kappa$ such that for any neighborhood assignment $U:X\to \tau_X$ there is a set $A\in [X]^\kappa$ with $A\cap U(x)\ne\emptyset$ for all $x\in X$.…
It is well-known that the consistency strength of the GCH failing at a measurable cardinal is the existence of a cardinal $\kappa$ with $o(\kappa)=\kappa^{++}$. As the literature does not contain more than a proof sketch of the lower bound…
We prove that consistently there is a singular cardinal $\kappa$ of uncountable cofinality such that $2^\kappa$ is weakly inaccessible, and every regular cardinal strictly between $\kappa$ and $2^\kappa$ is the character of some uniform…
This paper is a study of ``topological'' lower bounds for the chromatic number of a graph. Such a lower bound was first introduced by Lov\'asz in 1978, in his famous proof of the \emph{Kneser conjecture} via Algebraic Topology. This…
Ordinary infinitary languages L_{lambda, kappa} satisfy the Interpolation Theorem only in the case lambda <= {aleph_1}, kappa = {aleph_0}, this include first order logic of course. There are also some pairs of such logics satifying…
We prove two $\mathrm{ZFC}$ inequalities between cardinal invariants. The first inequality involves cardinal invariants associated with an analytic P-ideal, in particular the ideal of subsets of $\omega$ of asymptotic density $0$. We obtain…
By a finite type-graph we mean a graph whose set of vertices is the set of all $k$-subsets of $[n]=\{1,2,\ldots, n\}$ for some integers $n\ge k\ge 1$, and in which two such sets are adjacent if and only if they realise a certain order type…
We describe a framework for proving consistency results about singular cardinals of arbitrary cofinality and their successors. This framework allows the construction of models in which the Singular Cardinals Hypothesis fails at a singular…
Assuming the existence of a supercompact cardinal, we construct a model where, for some uncountable regular cardinal $\kappa$, there are no $\Sigma^1_1(\kappa)-\kappa-$mad families.
Recent results of Hindman, Leader and Strauss and of the second author and Rinot showed that some natural analogs of Hindman's Theorem fail for all uncountable cardinals. Results in the positive direction were obtained by Komj\'ath, the…
We get a quite maximal version of the colouring property $Pr_1$ by proving $Pr_1(\lambda,\lambda,\lambda,\theta)$ when $\lambda = \partial^+, \partial > \theta$ are regular cardinals.
Graph parameters such as the clique number, the chromatic number, and the independence number are central in many areas, ranging from computer networks to linguistics to computational neuroscience to social networks. In particular, the…
A colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the second half. We show that planar graphs have nonrepetitive…
Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that $\kappa,\lambda$ are infinite cardinals such that $\kappa^{+++} \leq \lambda$, $\kappa^{<\kappa}=\kappa$ and $2^{\kappa}= \kappa^+$, and…
We investigate in ZFC what can be the family of large enough cardinals mu in which an a.e.c. K is categorical or even just solvable. We show that for not few cardinals lambda<mu there is a superlimit model in K_lambda. Moreover, our main…