Cover Image

On Generic Linearly Constrained Frameworks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Deniz, Zakir, Guler, Hakan, Nixon, Anthony
Format:	Preprint
Published:	2026
Subjects:	Combinatorics 52C25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

5-regular graphs and the 3-dimensional rigidity matroid
by: Monks, Rebecca, et al.
Published: (2025)

Generalised rigid body motions in non-Euclidean planes with applications to global rigidity
by: Dewar, Sean, et al.
Published: (2021)

$k$-fold circuits and coning in rigidity matroids
by: Hewetson, John, et al.
Published: (2025)

Generic Rigidity of Graph Frameworks in Euclidean Space
by: Heaton, Alexander
Published: (2026)

Stable cuts, NAC-colourings and flexible realisations of graphs
by: Clinch, Katie, et al.
Published: (2024)

On the uniqueness of collections of pennies and marbles
by: Dewar, Sean, et al.
Published: (2023)

The number of realisations of a random graph
by: Dewar, Sean, et al.
Published: (2026)

Angular constraints on planar frameworks
by: Dewar, Sean, et al.
Published: (2024)

Highly regular vertex-transitive graphs are globally rigid
by: Saliby, Angelo El
Published: (2026)

Characterizing globally linked pairs in graphs
by: Jordán, Tibor, et al.
Published: (2026)

Classifying the globally rigid edge-transitive graphs and distance-regular graphs in the plane
by: Dewar, Sean
Published: (2022)

Minimally rigid tensegrity frameworks
by: Clay, Adam D. W., et al.
Published: (2024)

Sharp thresholds for NAC-colourings and stable cuts in random graphs
by: Clinch, Katie, et al.
Published: (2025)

Counting Frameworks of Bipyramids
by: Southgate, Jack
Published: (2023)

Realizations of multiassociahedra via rigidity
by: Ruiz, Luis Crespo, et al.
Published: (2022)

Rigidity of Graphs and Frameworks: A Matroid Theoretic Approach
by: Cruickshank, James, et al.
Published: (2025)

The $d$-dimensional realisation number of a rigid graph
by: Dewar, Sean, et al.
Published: (2026)

Flexible realizations existence: NP-completeness on sparse graphs and algorithms
by: Laštovička, Petr, et al.
Published: (2024)

Periodicity and decidability of translational tilings by rational polygonal sets
by: Pont, Jaume de Dios, et al.
Published: (2024)

Sharp threshold for reconstructing points on the line
by: Zakharov, Georgii
Published: (2026)

Minimum degree conditions for graph rigidity
by: Krivelevich, Michael, et al.
Published: (2024)

Orientation-Reversing Crystallographic Rigidity
by: Esson, Jack, et al.
Published: (2025)

Homological methods in rigidity theory using graphs of groups
by: Vermant, Joannes
Published: (2026)

Counting for rigidity under projective transformations in the plane
by: Berman, Leah Wrenn, et al.
Published: (2025)

Structural rigidity and flexibility using graphs of groups
by: Vermant, Joannes, et al.
Published: (2023)

Noncompact surfaces, triangulations and rigidity
by: Power, Stephen C.
Published: (2024)

Quotient graphs of symmetrically rigid frameworks
by: Dewar, Sean, et al.
Published: (2022)

Rigidity of nearly planar classes of graphs
by: Dewar, Sean, et al.
Published: (2024)

A sufficient condition for planar graphs with maximum degree eight to be totally 9-colorable
by: Deniz, Zakir, et al.
Published: (2025)

Eight-Partitioning Points in 3D, and Efficiently Too
by: Aronov, Boris, et al.
Published: (2024)

Planar point sets with forbidden $4$-point patterns and few distinct distances
by: Tao, Terence
Published: (2024)

The Stress-Flex Conjecture
by: Connelly, Robert, et al.
Published: (2024)

Degree Sum Conditions for Graph Rigidity
by: Jordán, Tibor, et al.
Published: (2025)

New Nikodym set constructions over finite fields
by: Tao, Terence
Published: (2025)

The pure condition for incidence geometries
by: Bernstein, Daniel Irving, et al.
Published: (2025)

Non-Euclidean Crystallographic Rigidity
by: Esson, Jack, et al.
Published: (2025)

Computing maximum likelihood thresholds using graph rigidity
by: Bernstein, Daniel Irving, et al.
Published: (2022)

Simplices with fixed volumes of codimension 2 faces in a continuous deformation
by: Zhang, Lizhao
Published: (2023)

A counter-example to Baranyai's combinatorial characterisation for 3-rigidity
by: Dewar, Sean
Published: (2026)

Linearly-exponential checking is enough for the Lonely Runner Conjecture and some of its variants
by: Malikiosis, Romanos Diogenes, et al.
Published: (2024)