Related papers: Rigidity with few locations
Determining the number of (complex) realisations of a rigid graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we provide two new tools for determining realisation numbers in arbitrary…
The celebrated result of Gortler-Healy-Thurston (independently, Jackson-Jord\'an for $d=2$) shows that the global rigidity of graphs realised in the $d$-dimensional Euclidean space is a generic property. Extending this result to the global…
For a family $\mathcal{F}$ of graphs, let $ex(n,\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks…
We show that the size of a 4-critical graph of girth at least five is bounded by a linear function of its genus. This strengthens the previous bound on the size of such graphs given by Thomassen. It also serves as the basic case for the…
In this paper, we introduce a particularly nice family of locally CAT(-1) spaces, which we call hyperbolic P-manifolds. For $X^3$ a simple, thick hyperbolic P-manifold of dimension 3, we show that certain subsets of the boundary at infinity…
We generalize the Fenchel theorem for strong spacelike closed curves of index $1$ in the 3-dimensional Minkowski space, showing that the total curvature must be less than or equal to $2\pi$. Here strong spacelike means that the tangent…
We prove that for any knot $K$, there exists a one-vertex triangulation of the $3$-sphere containing an edge forming $K$. The proof is constructive, and based on fully augmented links. We use our method to produce ``complicated'' simplicial…
As we add rigid bars between points in the plane, at what point is there a giant (linear-sized) rigid component, which can be rotated and translated, but which has no internal flexibility? If the points are generic, this depends only on the…
We discuss the rigidity (or lack thereof) imposed by different notions of having an abundance of zero curvature planes on a complete Riemannian 3-manifold. We prove a rank rigidity theorem for complete 3-manifolds, showing that having…
A finite simple graph G is declared to have positive curvature if every in G embedded wheel graph has five or six vertices. A d-graph is a finite simple graph G for which every unit sphere is a (d-1)-sphere. A d-sphere is a d-graph G for…
For any compact, connected, orientable, finite-type surface with marked points other than the sphere with three marked points, we construct a finite rigid set of its arc complex: a finite simplicial subcomplex of its arc complex such that…
We use Hanf locality and a result of Cruickshank, Jackson, and Tanigawa on the global rigidity of graphs of $k$-circuits to prove that local and global $d$-rigidity are not definable in the first order logic of graphs.
Let $\Gamma<\mathrm{PSL}_2(\mathbb{C})\simeq \mathrm{Isom}^+(\mathbb{H}^3)$ be a finitely generated non-Fuchsian Kleinian group whose ordinary set $\Omega=\mathbb{S}^2-\Lambda$ has at least two components. Let $\rho : \Gamma \to…
In this paper we consider min-max minimal surfaces in three-manifolds and prove some rigidity results. For instance, we prove that any metric on a 3-sphere which has scalar curvature greater than or equal to 6 and is not round must have an…
We examine the generic local and global rigidity of various graphs in R^d. Bruce Hendrickson showed that some necessary conditions for generic global rigidity are (d+1)-connectedness and generic redundant rigidity and hypothesized that they…
We generalize the Fenchel theorem to strong spacelike (which means that the tangent vector and the curvature vector span a spacelike 2-plane at each point) closed curves with index 1 in the 3-dimensional Lorentz space, showing that the…
A theorem of Laman gives a combinatorial characterisation of the graphs that admit a realisation as a minimally rigid generic bar-joint framework in $\bR^2$. A more general theory is developed for frameworks in $\bR^3$ whose vertices are…
The zero locus of a function f on a graph G is defined as the graph with vertex set consisting of all complete subgraphs of G, on which f changes sign and where x,y are connected if one is contained in the other. For d-graphs, finite simple…
Confirming a conjecture posed by Caro, it was shown by Chen and Yu that every graph $G$ with $n$ vertices and at most $2n-4$ edges has a stable cutset, which is a stable set of vertices whose removal disconnects the graph. Le and Pfender…
In this article, we give a new upper bound for the regularity of edge ideals of gap-free graphs, in terms of the their minimal triangulation. Let $H_U=G\cup F_U$ be a minimal triangulation of a gap-free graph $G$, for some maximal…