Related papers: Angle-monotone Paths in Non-obtuse Triangulations

The notions of convexity and convex polytopes are introduced in the setting of tropical geometry. Combinatorial types of tropical polytopes are shown to be in bijection with regular triangulations of products of two simplices. Applications…

For every $n\in\mathbb N$ we construct a finite graph $G$ such that every orientation $\vec G$ of $G$ contains an isometric copy of any oriented tree on $n$ vertices, and evaluate the smallest possible cardinality of $G$. On the other hand,…

The question of shellability of complexes of directed trees was asked by R. Stanley. D. Kozlov showed that the existence of a complete source in a directed graph provides a shelling of its complex of directed trees. We will show that this…

In this note, we give answers to three questions from the paper [A. Das, Triameter of graphs, Discuss. Math. Graph Theory, 41 (2021), 601--616]. Namely, we obtain a tight lower bound for the triameter of trees in terms of order and number…

Consider a holomorphic torus action on vector bundles over a complex manifold which lifts to a holomorphic vector bundle. When the connected components of the fixed-point set are partially ordered, we construct, using sheaf-theoretical…

We generalise work of Young-Eun Choi to the setting of ideal triangulations with vertex links of arbitrary genus, showing that the set of all (possibly incomplete) hyperbolic cone-manifold structures realised by positively oriented…

Let $\Lambda$ be a closed, connected, spin Legendrian submanifold of the 1-jet space of a smooth $n$-dimensional manifold. We give a coherent orientation scheme for the moduli space of rigid Morse flow trees of $\Lambda$, implying that the…

This paper describes a way to subdivide a 3-manifold into angled blocks, namely polyhedral pieces that need not be simply connected. When the individual blocks carry dihedral angles that fit together in a consistent fashion, we prove that a…

We study upward planar straight-line embeddings (UPSE) of directed trees on given point sets. The given point set $S$ has size at least the number of vertices in the tree. For the special case where the tree is a path $P$ we show that: (a)…

We call a continuous path of polygons decreasing if the convex hulls of the polygons form a decreasing family of sets. For an arbitrary polygon of more than three vertices, we characterize the polygons contained in it that can be reached by…

Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of…

Building on Whitney's classical method of triangulating smooth manifolds, we show that every compact $d$-dimensional smooth manifold admits a triangulation with dual graph of twin-width at most $d^{O(d)}$. In particular, it follows that…

A square-contact representation of a planar graph $G=(V,E)$ maps vertices in $V$ to interior-disjoint axis-aligned squares in the plane and edges in $E$ to adjacencies between the sides of the corresponding squares. In this paper, we study…

Just how many different connected shapes result from slicing a cube along some of its edges and unfolding it into the plane? In this article we answer this question by viewing the cube both as a surface and as a graph of vertices and edges.…

One theorem of Nemhauser and Trotter ensures that, under certain conditions, a stable set of a graph G can be enlarged to a maximum stable set of this graph. For example, any stable set consisting of only simplicial vertices is contained in…

We show that there exist infinitely many pairwise distinct non-closed G_2-manifolds (some of which have holonomy full G_2) such that they admit co-oriented contact structures and have co-oriented contact submanifolds which are also…

We prove that the moduli space of complete Riemannian metrics of bounded geometry and uniformly positive scalar curvature on an orientable 3-manifold is path-connected. This generalizes the main result of the fourth author [Mar12] in the…

Recently L. B. Beasley introduced $(2,3)$-cordial labelings of directed graphs in [1]. He made two conjectures which we resolve in this article. He conjectured that every orientation of a path of length at least five is $(2,3)$ cordial, and…

A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…

Let $T$ be a tree, a vertex of degree one is a leaf of $T$ and a vertex of degree at least three is a branch vertex of $T$. For two distinct vertices $u,v$ of $T$, let $P_T[u,v]$ denote the unique path in $T$ connecting $u$ and $v.$ For a…