English
Related papers

Related papers: More on Compactness of Chromatic Numbers

200 papers

An infinite graph is said to be highly connected if the induced subgraph on the complement of any set of vertices of smaller size is connected. We continue the study of weaker versions of Ramsey Theorem on uncountable cardinals asserting…

Logic · Mathematics 2024-11-20 Michael Hrušák , Saharon Shelah , Jing Zhang

For a multigraph G, the integer round-up phi(G) of the fractional chromatic index yields a good general lower bound for the chromatic index . For an upper bound, Kahn showed that for any real c > 0 there exists a positive integer N so that…

Combinatorics · Mathematics 2010-12-24 Michael Plantholt

We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…

Logic · Mathematics 2007-05-23 Arthur W. Apter

Square-kappa-finite, the finite family version of weak square, holds at all cardinals kappa in the Mitchell-Steel inner models.

Logic · Mathematics 2016-09-07 Ernest Schimmerling

Let $G_{n,p}^{[\kappa]}$ denote the space of $n$-vertex edge coloured graphs, where each edge occurs independently with probability $p$. The colour of each existing edge is chosen independently and uniformly at random from the set…

Combinatorics · Mathematics 2025-08-13 Colin Cooper , Alan Frieze

In their paper from 1981, Milner and Sauer conjectured that for any poset P, if cf(P)=lambda>cf(lambda)=kappa, then P must contain an antichain of size kappa. We prove that for lambda>cf(lambda)=kappa, if there exists a cardinal mu<lambda…

Logic · Mathematics 2007-05-23 Assaf Rinot

Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…

Combinatorics · Mathematics 2017-04-04 Meysam Alishahi , Hossein Hajiabolhassan , Frédéric Meunier

We introduce the notion of weakly extendible cardinals and show that these cardinals are characterized in terms of weak compactness of second order logic. The consistency strength and largeness of weakly extendible cardinals are located…

Logic · Mathematics 2023-01-06 Sakaé Fuchino , Hiroshi Sakai

Resolving a problem raised by Norin, we show that for each $k \in \mathbb{N}$, there exists an $f(k) \le 7k$ such that every graph $G$ with chromatic number at least $f(k)+1$ contains a subgraph $H$ with both connectivity and chromatic…

Combinatorics · Mathematics 2020-04-06 António Girão , Bhargav Narayanan

The main result of this paper is to show that, if $\kappa$ is the smallest real-valued measurable cardinal not greater than $ 2^{\aleph_0}$, then there exists a complete metric space of cardinality not greater than $ 2^{\kappa}$ admitting a…

Logic · Mathematics 2020-12-22 Ryszard Frankiewicz , Joanna Jureczko

We prove that for every (infinite cardinal) lambda there is a T_3-space X with clopen basis, 2^mu points where mu = 2^lambda, such that every closed subspace of cardinality <|X| has cardinality < lambda .

Logic · Mathematics 2009-09-25 Saharon Shelah

The structure of automorphism groups of $\kappa$-existentially closed groups are studied by Kaya-Kuzucuo\u{g}lu in 2022. It was proved that Aut(G) is the union of subgroups of level preserving automorphisms and $|Aut(G)|=2^\kappa$ whenever…

Logic · Mathematics 2024-09-04 Burak Kaya , Mahmut Kuzucuoğlu , Patrizia Longobardi , Mercede Maj

It is well known that determining if a digraph has a kernel is an NP-complete problem. However, Topp proved that when subdividing every arc of a digraph we obtain a digraph with a kernel. In this paper we define the kernel subdivision…

Combinatorics · Mathematics 2023-12-29 Teresa I. Hoekstra-Mendoza , Miguel E. Licona-Velázquez , Rocío Rojas-Monroy

Suppose $\kappa$ is a regular cardinal and $\bar a=\langle \mu_i: i<\kappa \rangle$ is a non-decreasing sequence of regular cardinals. We study the set of possible cofinalities of cuts Pcut$(\bar a)=\{(\lambda_1, \lambda_2):$ for some…

Logic · Mathematics 2025-01-20 Mohammad Golshani

A graph $H$ is common if the number of monochromatic copies of $H$ in a 2-edge-colouring of the complete graph $K_n$ is asymptotically minimised by the random colouring. We prove that, given $k,r>0$, there exists a $k$-connected common…

Combinatorics · Mathematics 2023-06-14 Sejin Ko , Joonkyung Lee

Given a weakly compact cardinal $\kappa$, we give an axiomatization of intuitionistic first-order logic over $\mathcal{L}_{\kappa^+, \kappa}$ and prove it is sound and complete with respect to Kripke models. As a consequence we get the…

Logic · Mathematics 2020-12-29 Christian Espíndola

We improve previous work on the consistency strength of mutually stationary sequences of sets concentrating on points with divergent cofinality building on previous work by Adolf, Cox and Welch. Specifically, we have greatly reduced our…

Logic · Mathematics 2019-08-06 Dominik Adolf

Here we deal with some problems posed by Matet. The first section deals with the existence of stationary subsets of [lambda]^{<kappa} with no unbounded subsets which are not stationary, where, of course, kappa is regular uncountable less or…

Logic · Mathematics 2007-05-23 Saharon Shelah

We study the question of when an uncountable ccc topological space $X$ contains a ccc subspace of size $\aleph_1$. We show that it does if $X$ is compact Hausdorff and more generally if $X$ is Hausdorff with $\mathrm{pct}(X) \leq \aleph_1$.…

General Topology · Mathematics 2018-04-25 Ramiro de la Vega

We investigate which classes of infinite graphs have the Erd\H{o}s-P\'osa property (EPP). In addition to the usual EPP, we also consider the following infinite variant of the EPP: a class $\mathcal{G}$ of graphs has the $\kappa$-EPP, where…

Combinatorics · Mathematics 2024-11-06 Thilo Krill