Related papers: The canary tree
We develop basic cluster theory from an elementary point of view using a variation of binary trees which we call mixed cobinary trees. We show that the number of isomorphism classes of such trees is given by the Catalan number Cn where n is…
This paper introduces derivation trees for general grammars. Within these trees, it defines context-dependent pairs of nodes, corresponding to rewriting two neighboring symbols using a non context-free rule. It proves that the language…
We show that every structurally submodular separation system admits a canonical tree set which distinguishes its tangles.
We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject…
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data-structures. Categorically, they arise as final coalgebras for polynomial…
A 2-tree is a graph that can be formed by starting with a triangle and iterating the operation of making a new vertex adjacent to two adjacent vertices of the existing graph. Leizhen Cai asked in 1995 whether every maximal planar graph…
A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. We prove that for a given nullity more than 1, there are only finitely many integral trees. It is also shown that integral trees with…
Artificial Intelligence (AI) has long pursued models, theories, and techniques to imbue machines with human-like general intelligence. Yet even the currently predominant data-driven approaches in AI seem to be lacking humans' unique ability…
Trees fill many extremal roles in graph theory, being minimally connected and serving a critical role in the definition of $n$-good graphs. In this article, we consider the generalization of trees to the setting of $r$-uniform hypergraphs…
The properties of randomly evolving special trees having defined and analyzed already in two earlier papers (arXiv:cond-mat/0205650 and arXiv:cond-mat/0211092) have been investigated in the case when the continuous time parameter converges…
A tree with at most k leaves is called k-ended tree, and a tree with exactly k leaves is called k-end tree, where a leaf is a vertex of degree one. Contraction of a graph G along the edge e means deleting the edge e and identifying its end…
Higher order set theory has been a topic of interest for some time, with recent efforts focused on the strength of second order set theories [KW16]. In this paper we strive to present one 'theory of collections' that allows for a formal…
An increasing 1,2-tree is a labeled graph formed by starting with a vertex and then repeatedly attaching a leaf to a vertex or a triangle to an edge, the labeling of the vertices corresponding to the order in which the vertices are added.…
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…
This paper considers the enumeration of ternary trees (i.e. rooted ordered trees in which each vertex has 0 or 3 children) avoiding a contiguous ternary tree pattern. We begin by finding recurrence relations for several simple tree…
Many set theorists point to the linearity phenomenon in the hierarchy of consistency strength, by which natural theories tend to be linearly ordered and indeed well ordered by consistency strength. Why should it be linear? In this paper I…
A phylogenetic tree is a tree with a fixed set of leaves that has no vertices of degree two. In this paper, we axiomatically define four other discrete structures on the set of leaves. We prove that each of these structures is an equivalent…
By introducing the notions of living and dead nodes a new model of random tree evolution with continuous time parameter has been constructed. It is assumed that two random variables, the lifetime and the offspring number of living nodes…
CAC for trees is the statement asserting that any infinite subtree of $\mathbb{N}^{<\mathbb{N}}$ has an infinite path or an infinite antichain. In this paper, we study the computational strength of this theorem from a reverse mathematical…