Related papers: Cone avoiding closed sets

The union-closed sets conjecture (Frankl's conjecture) says that for any finite union-closed family of finite sets, other than the family consisting only of the empty set, there exists an element that belongs to at least half of the sets in…

An old conjecture of Ringel states that every tree with $m$ edges decomposes the complete graph $K_{2m+1}$. The best known lower bound for the order of a complete graph which admits a decomposition by every given tree with $m$ edges is…

Let $\mathfrak{i}$ denote the minimal cardinality of a maximal independent family and let $\mathfrak{a}_T$ denote the minimal cardinality of a maximal family of pairwise almost disjoint subtrees of $2^{<\omega}$. Using a countable support…

Let $\CaC\subset \Q^p$ be a rational cone. An affine semigroup $S\subset \CaC$ is a $\CaC$-semigroup whenever $(\CaC\setminus S)\cap \N^p$ has only a finite number of elements. In this work, we study the tree of $\CaC$-semigroups, give a…

Without assuming the field structure on the additive group of real numbers $\mathbb{R}$ with the usual order $<,$ we explore the fact that every proper subgroup of $\mathbb{R}$ is either closed or dense. This property of subgroups of the…

Let $\mathsf{TT}^1$ be the combinatorial principle stating that every finite coloring of the infinite full binary tree has a homogeneous isomorphic subtree. Let $\mathsf{RT}^2_2$ and $\mathsf{WKL}_0$ denote respectively the principles of…

It was proved by Huynh, Mohar, \v{S}\'amal, Thomassen and Wood in 2021 that any countable graph containing every countable planar graph as a subgraph has an infinite clique minor. We prove a finite, quantitative version of this result: for…

Every mathematical structure has an elementary extension to a pseudo-countable structure, one that is seen as countable inside a suitable class model of set theory, even though it may actually be uncountable. This observation, proved easily…

We show that for every graph $G$ that contains two edge-disjoint spanning trees, we can choose two edge-disjoint spanning trees $T_1,T_2$ of $G$ such that $|d_{T_1}(v)-d_{T_2}(v)|\leq 5$ for all $v \in V(G)$. We also prove the more general…

Our aim is to prove that if T is a complete first order theory, which is not superstable (no knowledge on this notion is required), included in a theory T_1 then for any lambda > |T_1| there are 2^lambda models of T_1 such that for any two…

This is the second of a series of four papers in which we prove the following relaxation of the Loebl-Komlos--Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at…

The tangled closure of a collection of subsets of a topological space is the largest subset in which each member of the collection is dense. This operation models a logical `tangle modality' connective, of significance in finite model…

For a group $G$, $\mathcal{F}_G$ denotes the set of all non-empty finite subsets of $G$. We extend the finitary coarse structure of $G$ from $G\times G$ to $\mathcal{F}_G\times \mathcal{F}_G$ and say that a macro-uniform mapping $f:…

We show that the commutator subgroup G' of a classical knot group G need not have subgroups of every finite index, but it will if G' has a surjective homomorphism to the integers and we give an exact criterion for that to happen. We also…

It is proven that if $G$ is a finite group, then $G^\omega$ has $2^{\mathfrak c}$ dense nonmeasurable subgroups. Also, other examples of compact groups with dense nonmeasurable subgroups are presented.

We show that for every integer $d$, there is a constant $N(d)$ such that if $K$ is any field and $F$ is a finite subset of $GL_d(K)$, which generates a non amenable subgroup, then $F^{N(d)}$ contains two elements, which freely generate a…

Suppose that $(x_s)_{s\in S}$ is a normalized family in a Banach space indexed by the dyadic tree $S$. Using Stern's combinatorial theorem we extend important results from sequences in Banach spaces to tree-families. More precisely,…

Let 2<n\leq l<m< \omega. Let L_n denote first order logic restricted to the first n variables. We show that the omitting types theorem fails dramatically for the n--variable fragments of first order logic with respect to clique guarded…

Consider a totally disconnected group G, which is covirtually cyclic, i.e., contains a normal compact open subgroup L such that G/L is infinite cyclic. We establish a Wang sequence, which computes the algebraic K-groups of the Hecke algebra…

One theorem of Nemhauser and Trotter ensures that, under certain conditions, a stable set of a graph G can be enlarged to a maximum stable set of this graph. For example, any stable set consisting of only simplicial vertices is contained in…