TR-2014-12

Combinatorial rigidity: graphs and matroids in the theory of rigid frameworks

Tibor Jordán



Abstract

This paper is based on the material I 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 {\it 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. I have also added several exercises and some new results.


Bibtex entry:

@techreport{egres-14-12,
AUTHOR = {Jord{\'a}n, Tibor},
TITLE = {Combinatorial rigidity: graphs and matroids in the theory of rigid frameworks},
NOTE= {{\tt www.cs.elte.hu/egres}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2014},
NUMBER = {TR-2014-12}
}


Last modification: 5.6.2018. Please email your comments to Tamás Király!