Related papers: Null Decomposition of Trees
The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these…
The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.
We introduce a class of metric spaces called $p$-additive combinations and show that for such spaces we may deduce information about their $p$-negative type behaviour by focusing on a relatively small collection of almost disjoint metric…
Robertson and Seymour proved two fundamental theorems about tangles in graphs: the tree-of-tangles theorem, which says that every graph has a tree-decomposition such that distinguishable tangles live in different nodes of the tree, and the…
A soft tree is an actively studied variant of a decision tree that updates splitting rules using the gradient method. Although soft trees can take various architectures, their impact is not theoretically well known. In this paper, we…
In this work, major principles of the mathematical constitution of space and the principles of construction of the physical space are presented. Generalized conceptions of distances and dimensionality evaluation are proposed, together with…
In 1996, Bodlaender showed the celebrated result that an optimal tree decomposition of a graph of bounded treewidth can be found in linear time. The algorithm is based on an algorithm of Bodlaender and Kloks that computes an optimal tree…
Merge trees are a type of graph-based topological summary that tracks the evolution of connected components in the sublevel sets of scalar functions. They enjoy widespread applications in data analysis and scientific visualization. In this…
Tangle-tree theorems are an important tool in structural graph theory, and abstract separation systems are a very general setting in which tangle-tree theorems can still be formulated and proven. For infinite abstract separation systems, so…
Treewidth is a parameter that measures how tree-like a relational instance is, and whether it can reasonably be decomposed into a tree. Many computation tasks are known to be tractable on databases of small treewidth, but computing the…
Generalized trees, we call them O-trees, are defined as hierarchical partial orders, i.e., such that the elements larger than any one are linearly ordered. Quasi-trees are, roughly speaking, undirected O-trees. For O-trees and quasi-trees,…
Phylogenetic trees are important tools in the study of evolutionary relationships between species. Measures such as the index of Sackin, Colless, and Total Cophenetic have been extensively used to quantify tree balance, one key property of…
Kriz and Thomas showed that every (finite or infinite) graph of tree-width $k \in \mathbb{N}$ admits a lean tree-decomposition of width $k$. We discuss a number of counterexamples demonstrating the limits of possible generalisations of…
We investigate the structure of trees that have greatest maximum eigenvalue among all trees with a given degree sequence. We show that in such an extremal tree the degree sequence is non-increasing with respect to an ordering of the…
For an arbitrary tree we investigate the problems of constructing a maximum matching which minimizes or maximizes the cardinality of a maximum matching of the graph obtained from original one by its removal and present corresponding…
We solve a conjecture by Becker et al. (arXiv:2404.05963) on the topic of zero forcing regarding the number of minimal forts of a tree. They conjectured and we prove $\mathcal{F}_{T_n} \le \binom{n}{2} \mathcal{F}_{P_n}$ where…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
We survey the definition and some elementary properties of real trees. There are no new results, as far as we know. One purpose is to give a number of different definitions and show the equivalence between them. We discuss also, for…
We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…
Disjoint-Set forests, consisting of Union-Find trees are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact structural characterization of these trees is known (such a…