The number of realisations of a rigid graph in Euclidean and spherical geometries
DOI10.5802/ALCO.390MaRDI QIDQ6662812
Publication date: 14 January 2025
Published in: Algebraic Combinatorics (Search for Journal in Brave)
Hyperbolic and elliptic geometries (general) and generalizations (51M10) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Graph representations (geometric and intersection representations, etc.) (05C62) Euclidean geometries (general) and generalizations (51M05) Metric embeddings as related to computational problems and algorithms (68R12)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Global rigidity: The effect of coning
- Projective background of the infinitesimal rigidity of frameworks
- Mixed volume techniques for embeddings of Laman graphs
- The red book of varieties and schemes
- Point-hyperplane frameworks, slider joints, and rigidity preserving transformations
- Equivalent realisations of a rigid graph
- The number of embeddings of minimally rigid graphs
- On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs
- An asymptotic upper bound for graph embeddings
- New upper bounds for the number of embeddings of minimally rigid graphs
- Counting realizations of Laman graphs on the sphere
- On the maximal number of real embeddings of minimally rigid graphs in \(\mathbb{R}^2,\mathbb{R}^3\) and \(S^2\)
- The Rigidity of Graphs
- The Number of Realizations of a Laman Graph
- Lower Bounds on the Number of Realizations of Rigid Graphs
- Generic Global Rigidity in Complex and Pseudo-Euclidean Spaces
This page was built for publication: The number of realisations of a rigid graph in Euclidean and spherical geometries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6662812)