Related papers: Origami edge-paths in the curve graph

Let $\Omega=(\omega_{j})_{j\in I}$ be a collection of pairwise non-isotopic simple closed curves on the closed, orientable, genus $g$ surface $S_{g}$, such that $\omega_{i}$ and $\omega_{j}$ intersect exactly once for $i\neq j$. It was…

A path $P$ in an edge-colored graph is called \emph{a conflict-free path} if there exists a color used on only one of the edges of $P$. An edge-colored graph $G$ is called \emph{conflict-free connected} if for each pair of distinct vertices…

We consider the zero-energy deformations of periodic origami sheets with generic crease patterns. Using a mapping from the linear folding motions of such sheets to force-bearing modes in conjunction with the Maxwell-Calladine index theorem…

A closed-form solution for the boundary of the flat state of an orthogonal cross section of contiguous surface geometry formed by the intersection of two cylinders of equal radii oriented in dual directions of rotation about their…

Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…

Given an origami crease pattern $C=(V,E)$, a straight-line planar graph embedded in a region of $\mathbb{R}^2$, we assign each crease to be either a mountain crease (which bends convexly) or a valley crease (which bends concavely), creating…

A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio…

The construction of atomically-precise carbon nanostructures holds promise for developing novel materials for scientific study and nanotechnology applications. Here we show that graphene origami is an efficient way to convert graphene into…

Consider two families of closed oriented curves in a d-manifold. At each point of intersecction of a curve of one family with a curve of the other family, form a new closed curve by going around the first curve and then going around the…

Let $\omega(G)$ and $\chi(G)$ denote the clique number and chromatic number of a graph $G$, respectively. The {\em disjointness graph} of a family of curves (continuous arcs in the plane) is the graph whose vertices correspond to the curves…

We find a closed-form expression for the Poisson's coefficient of curved-crease variants of the ``Miura ori'' origami tessellation. This is done by explicitly constructing a continuous one-parameter family of isometric piecewise-smooth…

In this note, we consider M-curves of odd degree with real scheme of the form $< \mathcal{J} \amalg \alpha \amalg 1 < \beta > >$. With help of complex orientations, we prove that for $m = 9$, $\alpha \geq 2$, and for $m = 11$, $\alpha \geq…

Edge ideals of finite simple graphs $G$ on $n$ vertices are the ideals $I(G)$ of the polynomial ring $S$ in $n$ variables generated by the quadratic monomials associated with the edges of $G$. In this paper, we consider the possible pairs…

A curve \gamma in the plane is t-monotone if its interior has at most t-1 vertical tangent points. A family of t-monotone curves F is \emph{simple} if any two members intersect at most once. It is shown that if F is a simple family of n…

If a graph $G_M$ is embedded into a closed surface $S$ such that $S \backslash G_M$ is a collection of disjoint open discs, then $M=(G_M,S)$ is called a {\em map}. A {\em zigzag} in a map $M$ is a closed path which alternates choosing, at…

We present a fixed-parameter tractable (FPT) algorithm to find a shortest curve that encloses a set of k required objects in the plane while paying a penalty for enclosing unwanted objects. The input is a set of interior-disjoint simple…

This paper focuses on packaging design using origami techniques, specifically designs incorporating curves, known as pillow boxes. While conventional paper packaging boxes are typically cuboid, pillow box designs include curved surfaces,…

A retract of a graph $\Gamma$ is an induced subgraph $\Psi$ of $\Gamma$ such that there exists a homomorphism from $\Gamma$ to $\Psi$ whose restriction to $\Psi$ is the identity map. A graph is a core if it has no nontrivial retracts. In…

The vertex connectivity of a graph $G$ is the size of the smallest set of vertices $S$ such that $G \setminus S$ is disconnected. For the class of planar graphs, the problem of vertex connectivity is well-studied, both from structural and…

This work is the extension of the results by the author in [7] and [6] for low-genus surfaces. Let $S$ be an orientable, connected surface of finite topological type, with genus $g \leq 2$, empty boundary, and complexity at least $2$; as a…