相关论文: The canary tree

A caterpillar tree is a connected, acyclic, graph in which all vertices are either a member of a central path, or joined to that central path by a single edge. In other words, caterpillar trees are the class of trees which become path…

In this paper we prove that the tree property can hold on regular cardinals in an interval which overlaps a strong limit cardinal. This is a crucial milestone in the long term project, tracing back to a question raised by Foreman and…

We show that for many models of random trees, the independence number divided by the size converges almost surely to a constant as the size grows to infinity; the trees that we consider include random recursive trees, binary and $m$-ary…

We construct combinatorial Hubbard trees for all unicritical polynomials, and for all exponential maps, for which the critical (singular) value does not escape. More precisely, out of an external angle, or more generally a kneading…

There is an unproven duality theory hypothesizing that random discrete trees and their poissonized embeddings in continuous time share fundamental properties. We give additional evidence in favor of this theory by showing that several…

Large cardinals arising from the existence of arbitrarily long end elementary extension chains over models of set theory are studied here. In particular, we show that the large cardinals obtained that way (`Unfoldable cardinals') behave as…

We prove that the Jacaranda tree obtained as a fixed point for a substreetution in previous work of the authors is strongly aperiodic and that the number of patches increases linearly with respect to the size of the patch. As a consequence…

A semiregular tree is a tree where all non-pendant vertices have the same degree. Belardo et al. (MATCH Commun. Math. Chem. 61(2), pp. 503-515, 2009) have shown that among all semiregular trees with a fixed order and degree, a graph with…

The sequence A120986 in the Encyclopedia of Integer Sequences counts ternary trees according to the number of nodes and the number of middle edges. Using a certain substition, the underlying cubic equation can be factored. This leads to an…

Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…

We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…

A tanglegram is a pair of binary trees with the same set of leaves. Unlabeled tanglegrams were counted recently by Billey, Konvalinka, and Matsen, who also proposed the problem of counting several variations of unlabeled tanglegrams…

Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…

It is proved that the average number of segments on the right branch of a binary tree of size n tends to 3 as n tends to $\infty$. Also the fraction of trees with k segments on the right branch from all trees of size n tends to…

The Brownian continuum tree was extensively studied in the 90s as a universal random metric space. One construction obtains the continuum tree by a change of metric from an excursion function (or continuous circle mapping) on $[0,1]$. This…

In the context of continuous first-order logic, special attention is often given to theories that are somehow continuous in an 'essential' way. A common feature of such theories is that they do not interpret any infinite discrete…

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,…

We prove that every graph has a canonical tree of tree-decompositions that distinguishes all principal tangles (these include the ends and various kinds of large finite dense structures) efficiently. Here `trees of tree-decompositions' are…

The cactus of a pointed graph is a discrete tree associated with this graph. Similarly, with every pointed geodesic metric space $E$, one can associate an $\R$-tree called the continuous cactus of $E$. We prove under general assumptions…

In this note, we study the geometry of the unit ball of the Banach space generated by the adequate family of all subsets of branches of the infinite binary tree, and answer several open questions related to slicely countably determined…