Every minimally generically globally rigid graph in R^d containing a subgraph isomorphic to K_{d+2} is isomorphic to K_{d+2}.
Garamvölgyi, B
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Cliques in minimally globally rigid graphs
Every minimally generically globally rigid graph in R^d containing a subgraph isomorphic to K_{d+2} is isomorphic to K_{d+2}.