Related papers: On L-shaped point set embeddings of trees: first n…

Given a rooted tree and a ranking of its leaves, what is the minimum number of inversions of the leaves that can be attained by ordering the tree? This variation of the problem of counting inversions in arrays originated in mathematical…

Let $T$ be an oriented tree on $n$ vertices with maximum degree at most $e^{o(\sqrt{\log n})}$. If $G$ is a digraph on $n$ vertices with minimum semidegree $\delta^0(G)\geq(\frac12+o(1))n$, then $G$ contains $T$ as a spanning tree, as…

The general communication tree embedding problem is the problem of mapping a set of communicating terminals, represented by a graph G, into the set of vertices of some physical network represented by a tree T. In the case where the vertices…

In this paper, we consider outlier embeddings into HSTs. In particular, for metric $(X,d)$, let $k$ be the size of the smallest subset of $X$ such that all but that subset (the ``outlier set'') can be probabilistically embedded into the…

We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…

The degree distribution of an ordered tree $T$ with $n$ nodes is $\vec{n} = (n_0,\ldots,n_{n-1})$, where $n_i$ is the number of nodes in $T$ with $i$ children. Let $\mathcal{N}(\vec{n})$ be the number of trees with degree distribution…

The node-averaged complexity of a problem captures the number of rounds nodes of a graph have to spend on average to solve the problem in the LOCAL model. A challenging line of research with regards to this new complexity measure is to…

An $r$-matching in a graph $G$ is a collection of edges in $G$ such that the distance between any two edges is at least $r$. A $2$-matching is also called an induced matching. In this paper, we estimate the maximum number of $r$-matchings…

In a rooted tree, we call a vertex {\em balanced} if it is at equal distance from all its descendant leaves. We count balanced vertices in three different tree varieties. For decreasing binary trees, we can prove that the probability that a…

Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree $\tree$ where the weight of each node is the sum of the weights of its children. A treemap for $\tree$ is a hierarchical partition of a rectangle…

A "tree-partition" of a graph $G$ is a partition of $V(G)$ such that identifying the vertices in each part gives a tree. It is known that every graph with treewidth $k$ and maximum degree $\Delta$ has a tree-partition with parts of size…

In this paper, we consider a coverage problem for uncertain points in a tree. Let T be a tree containing a set P of n (weighted) demand points, and the location of each demand point P_i\in P is uncertain but is known to appear in one of m_i…

Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…

A graph is called set-sequential if its vertices can be labeled with distinct nonzero vectors in $\mathbb{F}_2^n$ such that when each edge is labeled with the sum$\pmod{2}$ of its vertices, every nonzero vector in $\mathbb{F}_2^n$ is the…

The Subtree Isomorphism problem asks whether a given tree is contained in another given tree. The problem is of fundamental importance and has been studied since the 1960s. For some variants, e.g., ordered trees, near-linear time algorithms…

For a forbidden graph $L$, let $ex(p;L)$ denote the maximal number of edges in a simple graph of order $p$ not containing $L$. Let $T_n$ denote the unique tree on $n$ vertices with maximal degree $n-2$, and let $T_n^*=(V,E)$ be the tree on…

A drawing of a given (abstract) tree that is a minimum spanning tree of the vertex set is considered aesthetically pleasing. However, such a drawing can only exist if the tree has maximum degree at most 6. What can be said for trees of…

Let $H$ and $G$ be graphs on $n$ vertices, where $n$ is sufficiently large. We prove that if $H$ has Ore-degree at most 5 and $G$ has minimum degree at least $2n/3$ then $H\subset G.$

Given an ordered partition $\Pi =\{P_1,P_2, ...,P_t\}$ of the vertex set $V$ of a connected graph $G=(V,E)$, the \emph{partition representation} of a vertex $v\in V$ with respect to the partition $\Pi$ is the vector…

Given a smooth complex variety $X$, an algebraically skew embedding of $X$ is an embedding of $X$ into a complex projective space $\mathbb{P}^N$ such that for any two points $x,y\in X$, their embedded tangent spaces in $\mathbb{P}^N$ do not…