English
Related papers

Related papers: More on Compactness of Chromatic Numbers

200 papers

Haviv ({\em European Journal of Combinatorics}, 2019) has recently proved that some topological lower bounds on the chromatic number of graphs are also lower bounds on their orthogonality dimension over $\mathbb{R}$. We show that this holds…

Combinatorics · Mathematics 2019-10-14 Meysam Alishahi , Frédéric Meunier

We say that a graph $G$ is chromatic-choosable when its list chromatic number $\chi_{\ell}(G)$ is equal to its chromatic number $\chi(G)$. Chromatic-choosability is a well-studied topic, and in fact, some of the most famous results and…

Ohba has conjectured \cite{ohb} that if the graph $G$ has $2\chi(G)+1$ or fewer vertices then the list chromatic number and chromatic number of $G$ are equal. In this paper we prove that this conjecture is asymptotically correct. More…

Combinatorics · Mathematics 2007-05-23 Bruce Reed , Benny Sudakov

We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e. the cofinality of lambda^lambda is strictly bigger than cov(meagre_lambda), i.e. the minimal number of nowhere dense subsets of…

Logic · Mathematics 2022-09-07 Saharon Shelah

We show that there are locally compact spaces that can be condensed onto separable spaces but not onto compact separable spaces. We also show that for every cardinal $\kappa$ there is a locally compact topological group of cardinality…

General Topology · Mathematics 2025-11-19 István Juhász , Jan van Mill , Lajos Soukup

Answering some of the main questions from [MR13], we show that whenever $\kappa$ is a cardinal satisfying $\kappa^{< \kappa} = \kappa > \omega$, then the embeddability relation between $\kappa$-sized structures is strongly invariantly…

Logic · Mathematics 2021-02-18 Filippo Calderoni , Heike Mildenberger , Luca Motto Ros

A lambda colouring (or $L(2,1)-$colouring) of a graph is an assignment of non-negative integers (with minimum assignment $0$) to its vertices such that the adjacent vertices must receive integers at least two apart and vertices at distance…

Combinatorics · Mathematics 2019-01-07 Kaushik Majumder , Ushnish Sarkar

We study the $\kappa$-color cyclic particle system on the one-dimensional integer lattice $\mathbb{Z}$, first introduced by Bramson and Griffeath in \cite{bramson1989flux}. In that paper they show that almost surely, every site changes its…

Probability · Mathematics 2018-04-18 Eric Foxall , Hanbaek Lyu

Let G be an abelian group of cardinality N, where (N,6) = 1, and let A be a random subset of G. Form a graph Gamma_A on vertex set G by joining x to y if and only if x + y is in A. Then, almost surely as N tends to infinity, the chromatic…

Combinatorics · Mathematics 2016-09-14 Ben Green

A stationary subset $S$ of a regular uncountable cardinal $\kappa$ {\it reflects fully} at regular cardinals if for every stationary set $T \subseteq \kappa$ of higher order consisting of regular cardinals there exists an $\alpha \in T$…

Logic · Mathematics 2008-02-03 Thomas Jech , Jiří Witzany

Recently, the author found that there is a common mistake in some papers by using minimal counterexample and discharging method. We first discuss how the mistake is generated, and give a method to fix the mistake. As an illustration, we…

Combinatorics · Mathematics 2014-03-05 Tao Wang

If we fix a spanning subgraph $H$ of a graph $G$, we can define a chromatic number of $H$ with respect to $G$ and we show that it coincides with the chromatic number of a double covering of $G$ with co-support $H$. We also find a few…

Combinatorics · Mathematics 2008-09-04 Dongseok Kim , Jaeun Lee

We show in detail that every compact countable subset of a metric space is homeomorphic to a countable ordinal number, which extends a result given by Mazurkiewicz and Sierpinski for finite-dimensional Euclidean spaces. In order to achieve…

General Topology · Mathematics 2019-11-12 Borys Álvarez-Samaniego , Andrés Merino

We show that supercompactness and strong compactness can be equivalent even as properties of pairs of regular cardinals. Specifically, we show that if V models ZFC + GCH is a given model (which in interesting cases contains instances of…

Logic · Mathematics 2016-09-06 Arthur Apter , Saharon Shelah

We prove that the statement "for every infinite cardinal nu, every graph with list chromatic nu has coloring number at most beth_omega (nu)" proved by Kojman [6] using the RGCH theorem [11] implies the RGCG theorem via a short forcing…

Logic · Mathematics 2022-01-28 Saharon Shelah

We continue [Sh:b, Ch XIII] and [Sh:410]. Let W be an inner model of ZFC. Let kappa be a cardinal in V. We say that kappa-covering holds between V and W iff for all X in V with X subseteq ON and V models |X|< kappa, there exists Y in W such…

Logic · Mathematics 2016-09-06 Saharon Shelah

Let $ \kappa , \theta < \lambda$ be cardinals, with $\lambda$ and $\kappa$ regular. Concentrating on a simple case, we say that the triple $(\lambda,\kappa,\theta)$ has a Super Black Box when the following holds. For some stationary $S…

Logic · Mathematics 2026-02-11 Saharon Shelah

We prove the following two results. Theorem A: Let alpha be a limit ordinal. Suppose that 2^{|alpha|}<aleph_alpha and 2^{|alpha|^+}<aleph_{|alpha|^+}, whereas aleph_alpha^{|alpha|}>aleph_{|alpha|^+}. Then for all n< omega and for all…

Logic · Mathematics 2014-11-11 Moti Gitik , Ralf Schindler , Saharon Shelah

We address a number of problems on Boolean Algebras. For example, we construct, in ZFC, for any BA B, and cardinal kappa BAs B_1,B_2 extending B such that the depth of the free product of B_1,B_2 over B is strictly larger than the depths of…

Logic · Mathematics 2016-09-06 Saharon Shelah

We prove that every point-finite family of nonempty functionally open sets in a topological space $X$ has the cardinality at most an infinite cardinal $\kappa$ if and only if $w(X)\leq\kappa$ for every Valdivia compact space $Y\subseteq…

General Topology · Mathematics 2015-12-25 V. V. Mykhaylyuk