English
Related papers

Related papers: The Tree Property up to $\aleph_{\omega^2}$

200 papers

We prove some general results about quasi-actions on trees and define Property (QFA), which is analogous to Serre's Property (FA), but in the coarse setting. This property is shown to hold for a class of groups, including $SL(n,\Z)$ for…

Group Theory · Mathematics 2007-05-23 Jason Fox Manning

We prove the following indistinguishability theorem for $k$-tuples of trees in the uniform spanning forest of $\mathbb{Z}^d$: Suppose that $\mathscr{A}$ is a property of a $k$-tuple of components that is stable under finite modifications of…

Probability · Mathematics 2018-10-16 Tom Hutchcroft

The relationship between two important problems in tree pattern matching, the largest common subtree and the smallest common supertree problems, is established by means of simple constructions, which allow one to obtain a largest common…

Data Structures and Algorithms · Computer Science 2007-05-23 Francesc Rossello , Gabriel Valiente

We find sufficient conditions under which the product of spaces that have a $\pi$-tree also has a $\pi$-tree. These conditions give new examples of spaces with a $\pi$-tree: every at most countable power of the Sorgenfrey line and every at…

General Topology · Mathematics 2016-11-29 Mikhail Patrakeev

The reconstruction of a central tendency `species tree' from a large number of conflicting gene trees is a central problem in systematic biology. Moreover, it becomes particularly problematic when taxon coverage is patchy, so that not all…

Populations and Evolution · Quantitative Biology 2013-07-22 Mike Steel

Let $T$ be a tree with an irreducible characteristic polynomial $\phi(x)$ over $\mathbb{Q}$. Let $\Delta(T)$ be the discriminant of $\phi(x)$. It is proved that if $2^{-\frac n2}\sqrt{\Delta(T)}$ (which is always an integer) is odd and…

Combinatorics · Mathematics 2023-10-03 Yizhe Ji , Wei Wang , Hao Zhang

We study the structure of trees minimizing their number of stable sets for given order $n$ and stability number $\alpha$. Our main result is that the edges of a non-trivial extremal tree can be partitioned into $n-\alpha$ stars, each of…

Combinatorics · Mathematics 2024-03-11 Véronique Bruyère , Gwenaël Joret , Hadrien Mélot

For a graph $G$, let $\lambda_2(G)$ denote the second largest eigenvalue of the adjacency matrix of $G$. We determine the extremal trees with maximum/minimum adjacency eigenvalue $\lambda_2$ in the class $\mathcal{T}(n,d)$ of $n$-vertex…

Combinatorics · Mathematics 2024-09-04 Hitesh Kumar , Bojan Mohar , Shivaramakrishna Pragada , Hanmeng Zhan

We show that it is consistent from an inaccessible cardinal that classical Namba forcing has the weak $\omega_1$-approximation property. In fact, this is the case if $\aleph_1$-preserving forcings do not add cofinal branches to…

Logic · Mathematics 2025-03-24 Maxwell Levine

A graph has tree-width at most $k$ if it can be obtained from a set of graphs each with at most $k+1$ vertices by a sequence of clique sums. We refine this definition by, for each non-negative integer $\theta$, defining the…

Combinatorics · Mathematics 2016-09-30 Jim Geelen , Benson Joeris

Let kappa be the limit of <kappa_n : n<omega> (1) if each kappa_n carries an extender of the length of the first Mahlo above kappa_n, then for every ld above kappa there is a generic extension with power of kappa above ld. (2) if each…

Logic · Mathematics 2007-05-23 Moti Gitik

Let $\mathcal{B}$ be the set of rooted trees containing an infinite binary subtree starting at the root. This set satisfies the metaproperty that a tree belongs to it if and only if its root has children $u$ and $v$ such that the subtrees…

Probability · Mathematics 2020-06-11 Tobias Johnson , Moumanti Podder , Fiona Skerman

We provide explicit upper bounds for the eigenvalues of the Laplacian on a finite metric tree subject to standard vertex conditions. The results include estimates depending on the average length of the edges or the diameter. In particular,…

Spectral Theory · Mathematics 2016-07-28 Jonathan Rohleder

A subset $M$ of a continuum $X$ is called a \textit{meager composant} if $M$ is maximal with respect to the property that every two of its points are contained in a nowhere dense subcontinuum of $X$. Motivated by questions of Bellamy,…

General Topology · Mathematics 2022-12-26 David S. Lipham

We answer a variant of a question of Rodl and Voigt by showing that, for a given infinite cardinal lambda, there is a graph G of cardinality kappa =(2^lambda)^+ such that for any colouring of the edges of G with lambda colours, there is an…

Logic · Mathematics 2008-02-03 Eric C. Milner , Saharon Shelah

We study the local convergence of critical Galton-Watson trees and Levy trees under various conditionings. Assuming a very general monotonicity property on the functional of random trees, we show that random trees conditioned to have large…

Probability · Mathematics 2015-08-11 Xin He

This paper focuses on the characterization of $\aleph_0$-categorical theories of trees in the following sense: for any $\aleph_0$-cateorical theory $T$ of trees there is a tree plan $\Gamma$ such that $T=Th(\Gamma(\omega))$ where…

Logic · Mathematics 2023-07-18 Mostafa Mirabi

We prove the consistency, assuming an ineffable cardinal, that any two normal countably closed $\omega_2$-Aronszajn trees are club isomorphic. This work generalizes to higher cardinals the property of Abraham-Shelah that any two normal…

Logic · Mathematics 2018-06-05 John Krueger

The aim of this paper is to provide an affirmative answer to a recent question by Bubeck and Linial on the local profile of trees. For a tree $T$, let $p^{(k)}_1(T)$ be the proportion of paths among all $k$-vertex subtrees (induced…

Combinatorics · Mathematics 2016-02-16 Éva Czabarka , László A. Székely , Stephan Wagner

A tree ${\mathbb T} =\langle T\leq \rangle$ is reversible iff there is no order $\preccurlyeq \;\varsubsetneq \;\leq $ such that ${\mathbb T} \cong \langle T ,\preccurlyeq\rangle$. Using a characterization of reversibility via back and…

Logic · Mathematics 2023-10-31 Miloš S. Kurilić