相关论文: The minimum asymptotic density of binary caterpill…

The fractional arboricity of a digraph $D$, denoted by $\gamma(D)$, is defined as $\gamma(D)= \max_{H \subseteq D, |V(H)| >1} \frac {|A(H)|} {|V(H)|-1}$. Frank in [Covering branching, Acta Scientiarum Mathematicarum (Szeged) 41 (1979),…

We show that an infinite Galton-Watson tree, conditioned on its martingale limit being smaller than $\eps$, agrees up to generation $K$ with a regular $\mu$-ary tree, where $\mu$ is the essential minimum of the offspring distribution and…

We study several enumeration problems connected to linear trees, a broad class which includes stars, paths, generalized stars, and caterpillars. We provide generating functions for counting the number of linear trees on $n$ vertices,…

In analogy to a concept of Fibonacci trees, we define the leaf-Fibonacci tree of size $n$ and investigate its number of nonisomorphic leaf-induced subtrees. Denote by $f_0$ the one vertex tree and $f_1$ the tree that consists of a root with…

Let $R_T$ be the Ricci matrix of a finite tree $T$ introduced in \cite{BaiChengHua2026}, the largest eigenvalue $\lambda_{\max}(R_T)$ determines the sign of a discrete Einstein metric curvature on the tree. This paper investigates the…

We investigate isometric embeddings of finite metric trees into $(\mathbb{R}^n,d_{1})$ and $( \mathbb{R}^n, d_{\infty})$. We prove that a finite metric tree can be isometrically embedded into $(\mathbb{R}^n,d_{1})$ if and only if the number…

Null models of binary phylogenetic trees are useful for testing hypotheses on real world phylogenies. In this paper we consider phylogenies as binary trees without edge lengths together with a sampling measure and encode them as algebraic…

It is conjectured that Hadamard matrices exist for all orders $4t$ ($t>0$). However, despite a sustained effort over more than five decades, the strongest overall existence results are asymptotic results of the form: for all odd natural…

According to the classic Chv{\'{a}}tal's Lemma from 1977, a graph of minimum degree $\delta(G)$ contains every tree on $\delta(G)+1$ vertices. Our main result is the following algorithmic "extension" of Chv\'{a}tal's Lemma: For any…

We prove a harmonic asymptotics density theorem for asymptotically flat initial data sets with compact boundary that satisfy the dominant energy condition. We use this to settle the spacetime positive mass theorem, with rigidity, for…

In a recent paper, McDiarmid, Semple, and Welsh (2015) showed that the number of tree-child networks with $n$ leaves has the factor $n^{2n}$ in its main asymptotic growth term. In this paper, we improve this by completely identifying the…

A set $D$ of vertices in $G$ is a disjunctive dominating set in $G$ if every vertex not in $D$ is adjacent to a vertex of $D$ or has at least two vertices in $D$ at distance $2$ from it in $G$. The disjunctive domination number,…

The space requirements of an $m$-ary search tree satisfies a well-known phase transition: when $m\leq 26$, the second order asymptotics is Gaussian. When $m\geq 27$, it is not Gaussian any longer and a limit $W$ of a complex-valued…

We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected…

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…

We consider a system of q diffusing particle species A_1,A_2,...,A_q that are all equivalent under a symmetry operation. Pairs of particles may annihilate according to A_i + A_j -> 0 with reaction rates k_{ij} that respect the symmetry, and…

We show that the growth of a unimodular random rooted tree $(T,o)$ of degree bounded by $d$ always exists, assuming its upper growth passes the critical threshold $\sqrt{d-1}$. This complements Timar's work who showed the possible…

We investigate the inner vertex-isoperimetric problem on the $d$-regular tree $T_d$. We first determine the exact value of the inner vertex-isoperimetric profile $I_d(k) = \min\{ |\partial D| \mid D\subset T_d \text{ finite and connected},\…

We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1-\epsilon)n vertices, in terms of the expansion properties of G. As a result we show that for fixed d\geq 2…

Consider an infinite graph with nodes initially labeled by independent Bernoulli random variables of parameter p. We address the density classification problem, that is, we want to design a (probabilistic or deterministic) cellular…