Related papers: On trees covering chains or stars
In this paper, we focus on properties of dessins d'enfants associated to trigonal curves. Degtyarev studied dessins d'enfants to compute braid monodromies and fundamental groups of trigonal curves using their combinatorial data. We first…
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…
We introduce a family of models, which we name matrix models associated with children's drawings -- the so-called dessin d'enfant. Dessins d'enfant are graphs of a special kind drawn on a closed connected orientable surface (in the sky).…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
Coverings of the Riemann sphere by itself, ramified over two points, are given by so-called Shabat polynomials. The correspondence between Grothendieck's dessins d'enfants and Belyi maps then implies a bijection between Shabat polynomials…
Tree-child networks are a recently-described class of directed acyclic graphs that have risen to prominence in phylogenetics (the study of evolutionary trees and networks). Although these networks have a number of attractive mathematical…
A {\em tree cover} of a metric space $(X,d)$ is a collection of trees, so that every pair $x,y\in X$ has a low distortion path in one of the trees. If it has the stronger property that every point $x\in X$ has a single tree with low…
We study the design of efficient algorithms for combinatorial pattern matching. More concretely, we study algorithms for tree matching, string matching, and string matching in compressed texts.
Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…
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 consider the enumeration of plane trees (rooted ordered trees) whose vertices are colored according to a specific coloring rule that prescribes which possible pairs of colors can occur as the colors of a parent vertex and its child. This…
Based on decision trees, many fields have arguably made tremendous progress in recent years. In simple words, decision trees use the strategy of "divide-and-conquer" to divide the complex problem on the dependency between input features and…
We give an account of the basic combinatorial structure underlying the notion of type dependency. We do so by considering the category of all dependent sequent calculi, and exhibiting it as the category of algebras for a monad on a presheaf…
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…
Let $P$ be a set of $n$ points in the plane in general position. We show that at least $\lfloor n/3\rfloor$ plane spanning trees can be packed into the complete geometric graph on $P$. This improves the previous best known lower bound…
Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of…
We study the problem of decomposing (clustering) a tree with respect to costs attributed to pairs of nodes, so as to minimize the sum of costs for those pairs of nodes that are in the same component (cluster). For the general case and for…
Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…
Construction of phylogenetic trees and networks for extant species from their characters represents one of the key problems in phylogenomics. While solution to this problem is not always uniquely defined and there exist multiple methods for…