English
Related papers

Related papers: A Strong Kurepa Tree

200 papers

We prove a new system of relations in the tautological ring of the moduli space of curves involving stable rooted trees with level structure decorated by the top Chern class of the Hodge bundle and $\Omega$-classes and double ramification…

Algebraic Geometry · Mathematics 2024-06-11 Xavier Blot , Danilo Lewański , Sergey Shadrin

We show that for any regular cardinal $\kappa$, $\square_{\kappa, 2}$ is consistent with "all $\kappa^+$-Aronszajn trees are special." By a result of Shelah and Stanley this is optimal in the sense that $\square_{\kappa, 2}$ may not be…

Logic · Mathematics 2019-04-01 John Susice

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 a subgraph. Our result confirms, for…

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

With the help of various square principles, we obtain results concerning the consistency strength of several statements about trees containing ascent paths, special trees, and strong chain conditions. Building on a result that shows that…

Logic · Mathematics 2019-02-20 Chris Lambie-Hanson , Philipp Lücke

An $\alpha$-thin tree $T$ of a graph $G$ is a spanning tree such that every cut of $G$ has at most an $\alpha$ proportion of its edges in $T$. The Thin Tree Conjecture proposes that there exists a function $f$ such that for any $\alpha >…

Computational Complexity · Computer Science 2026-01-01 Alice Moayyedi

We use generalizations of concepts from descriptive set theory to study combinatorial objects of uncountable regular cardinality, focussing on higher Kurepa trees and the representation of the sets of cofinal branches through such trees as…

Logic · Mathematics 2021-03-19 Philipp Lücke , Philipp Schlicht

A wide Aronszajn tree is a tree of size and height $\omega_1$ with no uncountable branches. We prove that under $MA(\omega_1)$ there is no wide Aronszajn tree which is universal under weak embeddings. This solves an open question of Mekler…

Logic · Mathematics 2023-06-22 Mirna Džamonja , Saharon Shelah

A wide Aronszajn tree is a tree of size $\aleph_1$ with no uncountable branches. Assuming the consistency of the existence of a weakly compact cardinal, we show the consistency of the existence of a wide Aronszajn tree that is…

Logic · Mathematics 2025-11-11 Siiri Kivimäki

Assuming the existence of a proper class of supercompact cardinals, we force that for every regular cardinal $\kappa$, there are $\kappa^+$-Aronszajn trees and all such trees are special.

Logic · Mathematics 2019-07-10 Mohammad Golshani , Yair Hayut

The main goal of this paper is to generalize the results that where presented in [11] for $\aleph_1$-Kurepa trees to $\aleph_{\alpha+1}$-Kurepa trees. We construct an $\mathcal{L}_{\omega_1,\omega}$-sentence $\psi_{\alpha}$, that codes…

Logic · Mathematics 2024-10-28 Georgios Marangelis

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

We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…

Combinatorics · Mathematics 2026-05-20 Richard Mycroft , Tássio Naia

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 investigate properties of trees of height $\omega_1$ and their preservation under subcomplete forcing. We show that subcomplete forcing cannot add a new branch to an $\omega_1$-tree. We introduce fragments of subcompleteness which are…

Logic · Mathematics 2018-02-06 Gunter Fuchs , Kaethe Minden

We show that it is consistent, relative to $\omega$ many supercompact cardinals, that the super tree property holds at $\aleph_n$ for all $2 \leq n < \omega$ but there are weak square and a very good scale at $\aleph_{\omega}$.

Logic · Mathematics 2016-11-08 Yair Hayut , Spencer Unger

We give a general construction of topological groups from combinatorial structures such as trees, towers, gaps, and subadditive functions. We connect topological properties of corresponding groups with combinatorial properties of these…

General Topology · Mathematics 2025-06-24 Boriša Kuzeljević , Stepan Milošević , Stevo Todorčević

We analyze the forcing notion $\mathcal P$ of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form $H_{\theta}$. We show that forcing with this poset adds a Kurepa tree $T$.…

Logic · Mathematics 2015-08-18 Borisa Kuzeljevic , Stevo Todorcevic

We prove that every weakly square compact cardinal is a strong limit cardinal. We also study Aronszajn trees with no uncountable finitely branching subtrees, characterizing them in terms of being Lindel\"of with respect to a particular…

Logic · Mathematics 2023-05-26 Pedro E. Marun

We introduce and study a new topology on trees, that we call the countably coarse wedge topology. Such a topology is strictly finer than the coarse wedge topology and it turns every chain complete, rooted tree into a Fr\'echet--Urysohn,…

General Topology · Mathematics 2022-03-16 Tommaso Russo , Jacopo Somaglia

We prove that the road space of an R-special tree is contractible and that a locally metrizable space containing a copy of an uncountable $\omega_1$-compact subspace of a tree is not. We also raise some questions about possible…

General Topology · Mathematics 2019-08-28 Mathieu Baillif