English
Related papers

Related papers: Cone avoiding closed sets

200 papers

We consider the intersection map on the family of non-empty $\omega$-Scott-open sets of the lattice of opens of a topological space. We prove that in a certain class of topological spaces the intersection map forms a continuous retraction…

Logic · Mathematics 2015-01-27 Matthias Schröder

The celebrated formula of Otter \emph{[Ann. of Math. (2) 49 (1948), 583--599]} asserts that the complete graph contains exponentially many non-isomorphic spanning trees. In this paper, we show that every connected almost regular graph with…

Combinatorics · Mathematics 2026-01-13 Hyunwoo Lee

In this paper and a companion paper, we prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as…

Combinatorics · Mathematics 2022-07-21 Bruce Reed , Maya Stein

In this paper we prove that any strongly embedded subgroup of a K*-group G of finite Morley rank and odd type that does not interpret any bad field is solvable if its Pruefer 2-rank is at least 2. If the normal 2-rank of G is at least 3…

Group Theory · Mathematics 2007-05-23 Christine Altseimer

We characterize the class of infinite connected graphs $ G $ for which there exists a $ T $-join for any choice of an infinite $ T \subseteq V(G) $. We also show that the following well-known fact remains true in the infinite case. If $ G $…

Combinatorics · Mathematics 2017-04-25 Attila Joó

Let a finite non-empty X is equipped with discrete topology. We prove that S \subseteq X^\omega is of second category if and only if for each f:\omega -> \bigcup_{n \in \omega} X^n there exists a sequence {a_n}_{n \in \omega} belonging to S…

Logic · Mathematics 2007-05-23 Apoloniusz Tyszka

It is proved in $\mathsf{ZF}$ (without the axiom of choice) that, for all infinite sets $M$, there are no surjections from $\omega\times M$ onto $\mathscr{P}(M)$.

Logic · Mathematics 2025-09-23 Yinhe Peng , Guozhen Shen

We show that for every ordinal $\alpha \in [1, \omega_1)$ there is a closed set $F \subset 2^\omega \times \omega^\omega$ such that for every $x \in 2^\omega$ the section $\{y\in \omega^\omega; (x,y) \in F\}$ is a two-point set and $F$…

Logic · Mathematics 2020-10-07 P. Holicky , M. Zeleny

We prove the following version of the Loebl-Komlos-Sos Conjecture: For every alpha>0 there exists a number M such that for every k>M every n-vertex graph G with at least (0.5+alpha)n vertices of degree at least (1+alpha)k contains each tree…

Combinatorics · Mathematics 2015-07-15 Jan Hladký , János Komlós , Diana Piguet , Miklós Simonovits , Maya Stein , Endre Szemerédi

We show that, consistently, there can be maximal subtrees of P (omega) and P (omega) / fin of arbitrary regular uncountable size below the size of the continuum. We also show that there are no maximal subtrees of P (omega) / fin with…

Logic · Mathematics 2016-11-28 Joerg Brendle

For any set $\Omega$ of non-negative integers such that $\{0,1\}\subseteq \Omega$ and $\{0,1\}\ne \Omega$, we consider a random $\Omega$-$k$-tree ${\sf G}_{n,k}$ that is uniformly selected from all connected $k$-trees of $(n+k)$ vertices…

Probability · Mathematics 2016-05-18 Michael Drmota , Emma Yu Jin , Benedikt Stufler

Motivated by a conjecture of Gy\'arf\'as, recently B\"ottcher, Hladk\'y, Piguet, and Taraz showed that every collection $T_1,\dots,T_t$ of trees on $n$ vertices with $\sum_{i=1}^te(T_i)\leq \binom{n}{2}$ and with bounded maximum degree, can…

Combinatorics · Mathematics 2016-04-20 Silvia Messuti , Vojtěch Rödl , Mathias Schacht

In 2012, Mader conjectured that for any tree $T$ of order $m$, every $k$-connected graph $G$ with minimum degree at least $\lfloor \frac{3k}{2}\rfloor+m-1$ contains a subtree $T'\cong T$ such that $G-V(T')$ remains $k$-connected. In 2022,…

Combinatorics · Mathematics 2025-11-11 Hojin Chu , Shinya Fujita , Boram Park , Homoon Ryu

Building off of recent results on Keisler's order, we show that consistently, $\leq_{SP}$ has infinitely many classes. In particular, we define the property of $\leq k$-type amalgamation for simple theories, for each $2 \leq k < \omega$. If…

Logic · Mathematics 2024-09-24 Saharon Shelah , Danielle Ulrich

The strong thin tree conjecture states that every $k$-edge-connected graph $G$ contains an $O(1/k)$-thin spanning tree, meaning a spanning tree which contains at most an $O(1/k)$ fraction of the edges across each cut in $G$. This conjecture…

Data Structures and Algorithms · Computer Science 2026-05-14 Nathan Klein , Neil Olver , Zi Song Yeoh

We show that the existence of a universal structure implies the existence of a generic structure for any approximable class $\mathcal{C}$ of countable structures. We also show that the converse is not true. As a consequence, we provide…

Logic · Mathematics 2022-06-23 Aristotelis Panagiotopoulos , Katrin Tent

We show that there is some absolute constant $c>0$, such that for any union-closed family $\mathcal{F} \subseteq 2^{[n]}$, if \mbox{$|\mathcal{F}| \geq (\frac{1}{2}-c)2^n$}, then there is some element $i \in [n]$ that appears in at least…

Combinatorics · Mathematics 2017-08-07 Ilan Karpas

We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n, all but countably many reals are n-random for such a measure,…

Logic · Mathematics 2021-04-06 Jan Reimann , Theodore A. Slaman

We work in set-theory without choice $\ZF$. Given a closed subset $F$ of $[0,1]^I$ which is a bounded subset of $\ell^1(I)$ ({\em resp.} such that $F \subseteq \ell^0(I)$), we show that the countable axiom of choice for finite subsets of…

Functional Analysis · Mathematics 2008-12-18 Marianne Morillon

In this paper we show that every set $A \subset \mathbb{N}$ with positive density contains $B+C$ for some pair $B,C$ of infinite subsets of $\mathbb{N}$, settling a conjecture of Erd\H{o}s. The proof features two different decompositions of…

Combinatorics · Mathematics 2019-06-14 Joel Moreira , Florian Karl Richter , Donald Robertson
‹ Prev 1 4 5 6 7 8 10 Next ›