Related papers: Folding median graphs
Let f be a smooth map between unit spheres of possibly different dimensions. We prove the global existence and convergence of the mean curvature flow of the graph of f under various conditions. A corollary is that any area-decreasing map…
The notion of a contractible transformation on a graph was introduced by Ivashchenko as a means to study molecular spaces arising from digital topology and computer image analysis, and more recently has been applied to topological data…
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…
Quasi-median graphs are a tool commonly used by evolutionary biologists to visualise the evolution of molecular sequences. As with any graph, a quasi-median graph can contain cut vertices, that is, vertices whose removal disconnect the…
Embedding graphs in continous spaces is a key factor in designing and developing algorithms for automatic information extraction to be applied in diverse tasks (e.g., learning, inferring, predicting). The reliability of graph embeddings…
This is the first part of a series on non-compact groups acting isometrically on compact Lorentz manifolds. This subject was recently investigated by many authors. In the present part we investigate the dynamics of affine, and especially…
We analyze the problem of folding one polyhedron, viewed as a metric graph of its edges, into the shape of another, similar to 1D origami. We find such foldings between all pairs of Platonic solids and prove corresponding lower bounds,…
Partial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means of semicubes, and Djokovi\'{c}'s and Winkler's relations play an important role in the theory of partial cubes. These structures are employed in the…
Finding coarse representations of large graphs is an important computational problem in the fields of scientific computing, large scale graph partitioning, and the reduction of geometric meshes. Of particular interest in all of these fields…
Using the special value at $u=1$ of Artin-Ihara $L$-functions, we associate to every $\mathbb{Z}$-cover of a finite connected graph a polynomial which we call the \emph{Ihara polynomial}. We show that the number of spanning trees for the…
In recent years, there has been significant interest in characterizing the induced subgraph obstructions to bounded treewidth and pathwidth. While this has recently been resolved for pathwidth, the case of treewidth remains open, and prior…
We discuss, on general grounds, how two subgraphs of a given Feynman graph can overlap with each other. For this, we use the notion of connecting and returning lines that describe how any subgraph is inserted within the original graph.…
The works of Commichau--Grauert and Hirschowitz showed that a formal equivalence between embeddings of a compact complex manifold is convergent, if the embeddings have sufficiently positive normal bundles in a suitable sense. We show that…
Using the theory of extensors developed in a previous paper we present a theory of the parallelism structure on arbitrary smooth manifold. Two kinds of Cartan connection operators are introduced and both appear in intrinsic versions (i.e.,…
We extend the Chern-Heinz inequalities about mean curvature and scalar curvature of graphs of $C^{2}$-functions to leaves of transversally oriented codimension one $C^{2}$-foliations of Riemannian manifolds. That extends partially…
We establish a correspondence between the dimer model on a bipartite graph and a circle pattern with the combinatorics of that graph, which holds for graphs that are either planar or embedded on the torus. The set of positive face weights…
An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we…
Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…
In this article, we construct countably many mutually non-isotopic diffeomorphisms of some closed non simply-connected 4-manifolds that are homotopic to but not isotopic to the identity, by surgery along $\Theta$-graphs. As corollaries of…
Point-set embeddings and large-angle crossings are two areas of graph drawing that independently have received a lot of attention in the past few years. In this paper, we consider problems in the intersection of these two areas. Given the…