Related papers: Absorbing angles, Steiner minimal trees, and antip…
The 1-Steiner tree problem, the problem of constructing a Steiner minimum tree containing at most one Steiner point, has been solved in the Euclidean plane by Georgakopoulos and Papadimitriou using plane subdivisions called oriented…
We develop a general method of proving that certain star configurations in finit e-dimensional normed spaces are Steiner minimal trees. This method generalizes the results of Lawlor and Morgan (1994) that could only be applied to…
Consider a compact $M \subset \mathbb{R}^d$ and $r > 0$. A maximal distance minimizer problem is to find a connected compact set $\Sigma$ of the minimal length, such that \[ \max_{y \in M} dist (y, \Sigma) \leq r. \] The inverse problem is…
Given a set of points, we define a minimum Steiner point tree to be a tree interconnecting these points and possibly some additional points such that the length of every edge is at most 1 and the number of additional points is minimized. We…
The aim of this paper is to provide an affirmative answer to a recent question by Bubeck and Linial on the local profile of trees. For a tree $T$, let $p^{(k)}_1(T)$ be the proportion of paths among all $k$-vertex subtrees (induced…
An L-shaped embedding of a tree in a point set is a planar drawing of the tree where the vertices are mapped to distinct points and every edge is drawn as a sequence of two axis-aligned line segments. There has been considerable work on…
We study the structure of trees minimizing their number of stable sets for given order $n$ and stability number $\alpha$. Our main result is that the edges of a non-trivial extremal tree can be partitioned into $n-\alpha$ stars, each of…
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…
A noncompact (oriented) surface satisfies the condition $(\star)$ if their isolated ends are ''accumulated by genus''. We show that every surface satisfying this condition is homeomorfic to the leaf of a minimal codimension one foliation on…
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…
The Euclidean Steiner problem is the problem of finding a set $St$, with the shortest length, such that $St \cup A$ is connected, where $A$ is a given set in a Euclidean space. The solutions $St$ to the Steiner problem will be called…
The class of $k$-star caterpillar convex bipartite graphs generalizes the class of convex bipartite graphs. For a bipartite graph with partitions $X$ and $Y$, we associate a $k$-star caterpillar on $X$ such that for each vertex in $Y$, its…
The Koml\'os-S\'ark\"ozy-Szemer\'edi (KSS) theorem establishes that a certain bound on the minimum degree of a graph guarantees it contains all bounded degree trees of the same order. Recently several authors put forward variants of this…
We consider a model of star copolymers, based on self-avoiding walks, where the arms of the star can be chemically distinct. The copolymeric star is attached to an impenetrable surface at a vertex of unit degree and the different monomers…
We prove that a compact stratied space satises the Riemannian curvature-dimension condition RCD(K, N) if and only if its Ricci tensor is bounded below by K $\in$ R on the regular set, the cone angle along the stratum of codimension two is…
A book embedding of the complete graph $K_n$ needs $\lceil \frac{n}{2} \rceil$ pages and the page-subgraphs can be chosen to be spanning paths (for $n$ even) and one spanning star for $n$ odd. We show that all page-subgraphs can be chosen…
We consider the isoperimetric problem for clusters in the plane with a double density, that is, perimeter and volume depend on two weights. In this paper we consider the isotropic case, in the parallel paper "On the Steiner property for…
Star-formation within galaxies appears on multiple scales, from spiral structure, to OB associations, to individual star clusters, and often sub-structure within these clusters. This multitude of scales calls for objective methods to find…
In this paper we discuss the Steiner property for minimal clusters in the plane with an anisotropic double density. This means that we consider the classical isoperimetric problem for clusters, but volume and perimeter are defined by using…
The Erd\H{o}s-S\'os Conjecture states that every graph with average degree exceeding $k-1$ contains every tree with $k$ edges as a subgraph. We prove that there are $\delta>0$ and $k_0\in\mathbb N$ such that the conjecture holds for every…