133 problems
Let , let be a graph, and let be a set of nonedges of . For each , write for the graph-nonedge pair obtained by adding the…
Let be a convex -gon, and place distinct points on the moment curve in . The associated bar-and-joint rigidity matroid is represented by the rigidity mat…
Let be a convex -gon, and let -triangulations be its maximal sets of diagonals containing no mutually crossing diagonals. Place generic points on the moment cur…
Let be a rigid graph and let . A pair of vertices is globally linked if every generic realisation of determines the distance between its two vertices. Globa…
Graph characterization conjecture. Then is generically minimally rigid on if and only if , , , or is -tight.
Let be the product of copies of . Let and be the products of, respectively, upper- and lower-unipotent one-parameter subg…
Let be a semisimple Lie group whose factors are all non-compact, let be an irreducible lattice, and let be an affine action of…
Let be a semi-simple Lie group with no compact factors and no simple factors isomorphic to or , and let be a lattice. A generalized quasi-affine a…
Let be a plane graph. A plane graph is generically rigid if its generic realizations are infinitesimally rigid, and it can be straightened as a pseudo-triangulation if its embe…
Six-connectivity conjecture. Every 6-connected -covered graph is rigid in .
Kiraly–Tanigawa's body-pin conjecture. The graph is rigid in if and only if, for every partition of ,
Let be a closed piecewise-linear surface, and let be its coned framework: the framework has the vertices and edges of , together with a cone vert…
Let be a differentiable one-parameter family of oriented piecewise-linear surfaces. For each facet , let be its unit normal and its volume, and define the dih…
Let , and let satisfy … for all and … Assume that the image of has size at least . Lew–Noy–Plaza–Eberhardt's conjecture. The second…
Let , let be the closed orientable surface of genus , and let a simple graph be called rigid in when it has a well-positioned realisation whose associated g…
Jackson–Tanigawa's rigidity conjecture. For and , is the unique maximal -matroid, and…
Jackson–Tanigawa's hyperconnectivity conjecture. For and , is the unique maximal -matroid, and…
Let be a multigraph, let be the body-hinge graph induced by , and let . A -superbrick is the graph-theoretic object defined in the source for the multigrap…
Let be a -tight multigraph, with . Let denote the graph with two vertices and parallel edges, and let a -…
Finiteness conjecture. There are only finitely many values of for which there exists a symmetric abstract -rigidity matroid in which…
Dewar's conjecture. There exists a function with the following property. For , if is a vertex-transitive graph of d…
Let be a positive integer, and let be a graph on vertices. Write and for the completability and hyperconnectivity matroids in…
Let , let , and let denote the complete graph on vertices. A graph is edge-redundantly rigid in a normed space if it has a framework that is infinite…
For each -connected embedded graph on the unit sphere with topological degree one and with every facial perimeter of length less than , define a partial or…
Let be a vertex -connected planar graph embedded in the unit-radius sphere. Assume that each edge is a geodesic of length less than and each face has total perimeter le…