arXiv · 2212.11231
Complete bipartite graphs flexible in the plane
Abstract
A complete bipartite graph $K_{3,3}$, considered as a planar linkage with joints at the vertices and with rods as edges, in general admits only motions as a whole, i.e., is inflexible. Two types of its paradoxical mobility were found by Dixon in 1899. Later on, in a series of papers by different authors, the question of flexibility of $K_{m,n}$ was solved for almost all pairs $(m,n)$. In the present paper, we solve it for all complete bipartite graphs in the Euclidean plane as well as in the sphere and in the hyperbolic plane. We give independent self-contained proofs without extensive computations which are almost the same in the Euclidean, hyperbolic and spherical cases.
Explore related subjects
Keep this discovery
M. D. Kovalev, S. Yu. Orevkov. 2022-12-21. Complete bipartite graphs flexible in the plane. https://doi.org/10.4213/sm9867e
Cite the original work for its findings. Save a collection to share your selection of sources.