Related papers: Cicho\'n's maximum

For any positive integer $k$, we show that every maximal $C_{2k+1}$-free graph with at least $n^2/4-o(n^{3/2})$ edges contains an induced complete bipartite subgraph on $(1-o(1))n$ vertices. We also show that this is best possible.

We show how to construct, via forcing, splitting families than are preserved by a certain type of finite support iterations. As an application, we construct a model where 15 classical characteristics of the continuum are pairwise different,…

The Erdos-Hajnal Conjecture asserts that for every graph H there is a constant c > 0 such that every graph G that does not contain H as an induced subgraph has a clique or stable set of cardinality at least |G|^c. In this paper, we prove a…

Assuming the consistency of a weakly compact cardinal above a regular uncountable cardinal $\mu$, we prove the consistency of the existence of a wide $\mu^+$-Aronszajn tree, i.e. a tree of height and cardinality $\mu^+$ with no branches of…

This note shows how recent work of Eskew and Hayut can be combined with a method of Raghavan and Shelah to show the consistency of $\mathfrak u_\kappa<2^\kappa$ for $\aleph_3\leq \kappa<\aleph_{\omega}$, from a huge cardinal.

Let kappa be an uncountable regular cardinal. Assuming 2^kappa=kappa^+, we show that the clone lattice on a set of size kappa is not dually atomic.

Assuming an abstract comparison principle called the Ultrapower Axiom, which is motivated by the comparison process of inner model theory and generalizes the statement that the Mitchell order is linear on normal ultrafilters, we…

For a Polish group G let cov_G be the minimal number of translates of a fixed closed nowhere dense subset of G required to cover G. For many locally compact G this cardinal is known to be consistently larger than cov(meager) which is the…

We investigate the provability of classical combinatorial theorems in ZF. Using combinatorial arguments, we establish the following results for each infinite cardinal ${\kappa}\in On$, (1) ${\kappa}^+\to ({\kappa},{\omega}+1)$, (2) any…

We prove that if there is a dominating family of size ${\aleph}_{1}$, then there is are ${\aleph}_{1}$ many compact subsets of ${\omega}^{\omega}$ whose union is a maximal almost disjoint family of functions that is also maximal with…

We consider the partition lattice $\Pi_\kappa$ on any set of transfinite cardinality $\kappa$ and properties of $\Pi_\kappa$ whose analogues do not hold for finite cardinalities. Assuming the Axiom of Choice we prove: (I) the cardinality of…

In this short note we determine the maximum number, over all $n$-vertex graphs $G$, of orientations of $G$ containing no strongly connected cycle $C_{2k+1}$. This answers a part of a recent question of Araujo, Botler and Mota.

We show the cardinality of a particular nonabelian cohomology associated to cyclic division algebras is equal to a certain partition number. This computation helps us interpret the number of conjugacy classes of maximal tori defined over an…

Let "ex" be the cardinality of the smallest independent family of subsets of omega (independent means that all nontrivial Boolean combinations are infinite) which cannot be extended to a homogeneous independent family. "Homogeneous" means…

Let $x,y\in(0,1]$ and let $A,B,C$ be disjoint nonempty subsets of a graph $G$, where every vertex in $A$ has at least $x|B|$ neighbours in $B$, and every vertex in $B$ has at least $y|C|$ neighbours in $C$. We denote by $\phi(x,y)$ the…

Chris Lambie-Hanson proved recently that for every function $ f:\mathbb{N}\rightarrow \mathbb{N} $ there is an $ \aleph_1 $-chromatic graph $ G $ of size $ 2^{\aleph_1} $ such that every $ (n+3) $-chromatic subgraph of $ G $ has at least $…

We give two results on guessing unbounded subsets of lambda^+. The first is a positive result and applies to the situation of lambda regular and at least equal to aleph_3, while the second is a negative consistency result which applies to…

The problem of determining the maximum number of copies of $T$ in an $H$-free graph, for any graphs $T$ and $H$, was considered by Alon and Shikhelman. This is a variant of Tur\'{a}n's classical extremal problem. We show lower and upper…

There has recently been work by multiple groups in extracting the properties associated with cardinal invariants of the continuum and translating these properties into similar analogous combinatorial properties of computational oracles.…

We prove that every digraph of independence number at most 2 and arc-connectivity at least 2 has an out-branching $B^+$ and an in-branching $B^-$ which are arc-disjoint (we call such branchings good pair). This is best possible in terms of…