Related papers: Intersection representation of digraphs in trees w…
An evolutionary tree is a rooted tree where each internal vertex has at least two children and where the leaves are labeled with distinct symbols representing species. Evolutionary trees are useful for modeling the evolutionary history of…
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…
In this work we study the interleaving distance between merge trees from a combinatorial point of view. We use a particular type of matching between trees to obtain a novel formulation of the distance. With such formulation, we tackle the…
In mathematical phylogenetics, evolutionary relationships are often represented by trees and networks. The latter are typically used whenever the relationships cannot be adequately described by a tree, which happens when so-called…
Topological drawings are representations of graphs in the plane, where vertices are represented by points, and edges by simple curves connecting the points. A drawing is simple if two edges intersect at most in a single point, either at a…
Rectangular layouts, subdivisions of an outer rectangle into smaller rectangles, have many applications in visualizing spatial information, for instance in rectangular cartograms in which the rectangles represent geographic or political…
A way to characterize the space of leaves of a foliation in terms of connections is proposed. A particular example of vertex algebra cohomology of codimension one foliations on complex curves is considered.
Given a collection of graphs $\mathbf{G}=(G_1, \ldots, G_m)$ with the same vertex set, an $m$-edge graph $H\subset \cup_{i\in [m]}G_i$ is a transversal if there is a bijection $\phi:E(H)\to [m]$ such that $e\in E(G_{\phi(e)})$ for each…
Let $Z$ be a non-compact two-dimensional manifold and $\Delta$ be a one-dimensional foliation of $Z$ such that $\partial Z$ consists of leaves of $\Delta$ and each leaf of $\Delta$ is a non-compact closed subset of $Z$. We obtain a…
Given a graph $G$, we define a filtration of simplicial complexes associated to $G$, $\mathcal{F}_0(G)\subseteq\mathcal{F}_1(G)\subseteq\cdots\subseteq\mathcal{F}_\infty(G)$ where the first complex is the independence complex and the last…
We establish the leafwise intersection property for closed, coisotropic submanifolds in an exact symplectic manifold satisfying natural additional assumptions.
An intersection digraph is a digraph where every vertex $v$ is represented by an ordered pair $(S_v, T_v)$ of sets such that there is an edge from $v$ to $w$ if and only if $S_v$ and $T_w$ intersect. An intersection digraph is reflexive if…
Planar partial $3$-trees are subgraphs of those planar graphs obtained by repeatedly inserting a vertex of degree $3$ into a face. In this paper, we show that planar partial $3$-trees have $1$-string $B_1$-VPG representations, i.e.,…
A congruence of the weak order is simple if its quotientope is a simple polytope. We provide an alternative elementary proof of the characterization of the simple congruences in terms of forbidden up and down arcs. For this, we provide a…
For a tree $T$, let $lp(T)$ be the number of different lengths of leaf to leaf paths in $T$. For a degree sequence $s$ of a tree, let ${\rm rad}(s)$ be the minimum radius of a tree with degree sequence $s$. Recently, Di Braccio,…
A vertex ranking of a graph is an assignment of ranks (or colors) to the vertices of the graph, in such a way that any simple path connecting two vertices of equal rank, must contain a vertex of a higher rank. In this paper we study a…
The main purpose of the paper is to develop an approach to evaluation or estimation of the spanning tree congestion of planar graphs. This approach is used to evaluate the spanning tree congestion of triangular grids.
The notion of friendliness between trees first appeared in solution of Lando's problem on intersection of polyhedra in 3-space. A tree is friendly to a path graph if edges of the tree can be numbered so that for each k,s the path between…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
Tree-based phylogenetic networks, which may be roughly defined as leaf-labeled networks built by adding arcs only between the original tree edges, have elegant properties for modeling evolutionary histories. We answer an open question of…