EUVIMEDEUVIMED entdecken
Crossref

Complete bipartite graphs flexible in the plane

Mikhail Dmitrievich Kovalev, Stepan Yur'evich Orevkov

Sbornik: Mathematics · 2023 · 214 (10) · 1390-1414

DOI: 10.4213/sm9867e ↗

Kurz gefasst

Fachartikel in der Zeitschrift Sbornik: Mathematics, online erschienen am 12.03.2024. Verfasst von Mikhail Dmitrievich Kovalev und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 11 Literaturangaben. Gefördert von: Ministry of Science and Higher Education of the Russian Federation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A complete bipartite graph $K_{3,3}$, considered as a planar linkage with joints at the vertices and with rods as edges, is in general inflexible, that is, it admits only motions as a whole. Two types of its paradoxical mobility were found by Dixon in 1899. Later on, in a series of papers by several different authors the question of the flexibility of $K_{m,n}$ was solved for almost all pairs $(m,n)$. We solve it for all complete bipartite graphs in the Euclidean plane, as well as on the sphere and hyperbolic plane. We give independent self-contained proofs without extensive computations, which are almost the same in the Euclidean, hyperbolic and spherical cases. Bibliography: 11 titles.

Förderung

  • Ministry of Science and Higher Education of the Russian Federation

Zitieren

APA

Kovalev, M. D., & Orevkov, S. Y. (2023). Complete bipartite graphs flexible in the plane. Sbornik: Mathematics, 214(10), 1390-1414. https://doi.org/10.4213/sm9867e

Vancouver

Kovalev MD, Orevkov SY. Complete bipartite graphs flexible in the plane. Sbornik: Mathematics. 2023;214(10):1390-1414. doi:10.4213/sm9867e

BibTeX
@article{Kovalev2023,
  author = {Kovalev, Mikhail Dmitrievich and Orevkov, Stepan Yur'evich},
  title = {Complete bipartite graphs flexible in the plane},
  journal = {Sbornik: Mathematics},
  year = {2023},
  volume = {214},
  number = {10},
  pages = {1390--1414},
  doi = {10.4213/sm9867e}
}
Kostenlos starten →