Mathematical Society of Japan Memoirs

II – Combinatorial Rigidity: Graphs and Matroids in the Theory of Rigid Frameworks

Tibor Jordán

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

This paper is based on material presented at the Research Institute for Mathematical Sciences (RIMS), Kyoto University, in October 2012 in a series of lectures. Thus, on one hand, it serves as the lecture note of this minicourse Combinatorial rigidity: graphs and matroids in the theory of rigid frameworks. On the other hand, this final, extended form is perhaps closer to a short monograph on combinatorial rigidity problems of two-dimensional frameworks. It contains the fundamental results of this area as well as a number of more recent results concerning extensions, variations and applications. Also added are several exercises and some new results.

Chapter information

Source
Martin T. Barlow, Tibor Jordán and Andrzej Zuk,Discrete Geometric Analysis (Tokyo: The Mathematical Society of Japan, 2016), 33-112

Dates
First available in Project Euclid: 23 May 2016

Permanent link to this document
https://projecteuclid.org/euclid.msjm/1464020508

Digital Object Identifier
doi:10.2969/msjmemoirs/03401C020

Zentralblatt MATH identifier
1348.52018

Subjects
Primary: 52C25: Rigidity and flexibility of structures [See also 70B15]
Secondary: 05C62: Graph representations (geometric and intersection representations, etc.) For graph drawing, see also 68R10 05B35: Matroids, geometric lattices [See also 52B40, 90C27] 05C10: Planar graphs; geometric and topological aspects of graph theory [See also 57M15, 57M25]

Rights
Copyright © 2016, The Mathematical Society of Japan

Citation

Jordán, Tibor. II – Combinatorial Rigidity: Graphs and Matroids in the Theory of Rigid Frameworks. Discrete Geometric Analysis, 33--112, The Mathematical Society of Japan, Tokyo, Japan, 2016. doi:10.2969/msjmemoirs/03401C020. https://projecteuclid.org/euclid.msjm/1464020508


Export citation