Related papers: Jamming and geometric representations of graphs
We present simpler algorithms for two closely related morphing problems, both based on the barycentric interpolation paradigm introduced by Floater and Gotsman, which is in turn based on Floater's asymmetric extension of Tutte's classical…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…
A lamination of a graph embedded on a surface is a collection of pairwise disjoint non-contractible simple closed curves drawn on the graph. In the case when the surface is a sphere with three punctures (a.k.a. a pair of pants), we first…
We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the minimum cut problem. Our new semidefinite programming relaxation of the minimum cut problem is obtained by strengthening the known…
The algorithm of Gutwenger et al. to insert an edge $e$ in linear time into a planar graph $G$ with a minimal number of crossings on $e$, is a helpful tool for designing heuristics that minimize edge crossings in drawings of general graphs.…
This is a contribution to the number theory of the dimer problem. The number of dimer coverings (i.e., perfect matchings) of a square lattice graph is discussed modulo powers of 2.
A "folklore conjecture, probably due to Tutte" (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341-355, Academic Press, 1979]) asserts that every bridgeless cubic…
High-dimensional multiplex graphs are characterized by their high number of complementary and divergent dimensions. The existence of multiple hierarchical latent relations between the graph dimensions poses significant challenges to…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
The embeddings of complex plane projective curves in the plane are a cornerstone of the topological study of algebraic varieties. In this work, we deal with the local and global aspects of these embeddings, with a special attention to its…
Immersions of graphs to the projective plane are studied. A classification of immersions up to regular homotopy is given. A complete invariant of immersions up to regular homotopy is constructed. Equivalence classes are described.
The fundamental role of on-shell diagrams in quantum field theory has been recently recognized. On-shell diagrams, or equivalently bipartite graphs, provide a natural bridge connecting gauge theory to powerful mathematical structures such…
In this work we extend recent study of the properties of the dense packing of "superdisks," by Y. Jiao, F. H. Stillinger and S. Torquato, Phys. Rev. Lett. 100, 245504 (2008), to the jammed state formed by these objects in random sequential…
Jamming in hard-particle packings has been the subject of considerable interest in recent years. In a paper by Torquato and Stillinger [J. Phys. Chem. B, 105 (2001)], a classification scheme of jammed packings into hierarchical categories…
A fundamental question in graph theory is to establish conditions that ensure a graph contains certain spanning subgraphs. Two well-known examples are Tutte's theorem on perfect matchings and Dirac's theorem on Hamilton cycles.…
Hermitian symplectic spaces provide a natural framework for the extension theory of symmetric operators. Here we show that hermitian symplectic spaces may also be used to describe the solution to the factorisation problem for the scattering…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
We introduce a polynomial invariant of graphs on surfaces, $P_G$, generalizing the classical Tutte polynomial. Topological duality on surfaces gives rise to a natural duality result for $P_G$, analogous to the duality for the Tutte…
We show that for any closed surface of genus greater than one and for any finite weighted graph filling the surface, there exists a hyperbolic metric which realizes the least Dirichlet energy harmonic embedding of the graph among a fixed…
Let A be the algebra generated by the power series \sum n^{n-1} q^n/n! and \sum n^n q^n /n! . We prove that many natural generating functions lie in this algebra: those appearing in graph enumeration problems, in the intersection theory of…