Related papers: Maximal origami flip graphs of flat-foldable verti…
Experiments [1] have shown that auto-kirigami structures can grow on the surface of graphene because the graphene-graphene adhesion energy is greater than the graphene-substrate interaction. In this work molecular dynamics (MD) simulations…
Cohesive subgraph discovery in a network is one of the fundamental problems and investigated for several decades. In this paper, we propose the Overlapping Cohesive Subgraphs with Minimum degree (OCSM) problem which combines three key…
Consider the family of all finite graphs with maximum degree $\Delta(G)<d$ and matching number $\nu(G)<m$. In this paper we give a new proof to obtain the exact upper bound for the number of edges in such graphs and also characterize all…
We study cross-graph charging schemes for graphs drawn in the plane. These are charging schemes where charge is moved across vertices of different graphs. Such methods have been recently applied to obtain various properties of…
The study of origami-based mechanical metamaterials usually focuses on the kinematics of deployable structures made of an assembly of rigid flat plates connected by hinges. When the elastic response of each panel is taken into account,…
A pseudo-triangle is a simple polygon with exactly three convex vertices, and all other vertices (if any) are distributed on three concave chains. A pseudo-triangulation~$\mathcal{T}$ of a point set~$P$ in~$\mathbb{R}^2$ is a partitioning…
We prove that if an $n$-vertex graph $G$ can be drawn in the plane such that each pair of crossing edges is independent and there is a crossing-free edge that connects their endpoints, then $G$ has $O(n)$ edges. Graphs that admit such…
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 a surface $\Sigma$ with punctures that serve as marked points and at least one marked point on each boundary component. We build a filling surface $\Sigma_n$ by singling out one of the boundary components and denoting by $n$ the…
We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of…
An efficient way to introduce elastic energy that can bias an origami structure toward desired shapes is to allow curved tiles between the creases. The bending of the tiles supplies the energy and the tiles themselves may have additional…
We describe an algorithm that morphs between two planar orthogonal drawings $\Gamma_I$ and $\Gamma_O$ of a connected graph $G$, while preserving planarity and orthogonality. Necessarily $\Gamma_I$ and $\Gamma_O$ share the same combinatorial…
This paper studies the problem of matching two complete graphs with edge weights correlated through latent geometries, extending a recent line of research on random graph matching with independent edge weights to geometric models.…
Schmith\"usen proved in 2004 that the Veech group of an origami is closely related to a subgroup of the automorphism group of the free group $F_2$. This result is significant in the sense that the framework of approachable Veech groups is…
Optimization problems consist of either maximizing or minimizing an objective function. Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum maximal solution (resp. maximum minimal solution). Such…
We show that every triangulation (maximal planar graph) on $n\ge 6$ vertices can be flipped into a Hamiltonian triangulation using a sequence of less than $n/2$ combinatorial edge flips. The previously best upper bound uses $4$-connectivity…
For origami structures, perforating or cutting slits along creases is an effective method to define fold lines and alleviate stress concentrations at vertices. In this letter we show numerically and experimentally that for…
The problem of computing the vertex expansion of a graph is an NP-hard problem. The current best worst-case approximation guarantees for computing the vertex expansion of a graph are a $O(\sqrt{\log n})$-approximation algorithm due to…
Kirigami, the art of paper cutting, has become a paradigm for mechanical metamaterials in recent years. The basic building blocks of any kirigami structures are repetitive deployable patterns that derive inspiration from geometric art forms…
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…