Friday, October 1, 2021 2pm to 3pm
About this Event
Date and Time: 10/01/2021, 14:00--15:00
Location: https://gsumeetings.webex.com/gsumeetings/j.php?MTID=ma63e26d1988cdeac78d1c46c645f148b
Colloquium: Sufficient conditions for 2-dimensional graph rigidity
Speaker: Gexin Yu, College of William & Mary
Speaker's website: https://gyu.people.wm.edu/index.html
Title: Sufficient conditions for 2-dimensional graph rigidity
Abstract: A graph is rigid if one places the vertices of the graph in the general position, there will be no simultaneous continuous motion of all the points, other than Euclidean congruences, that preserves the lengths of all the graph edges. In Geiringer, 1927, and independently Laman in 1970, gave a nice combinatorial characterization of rigid graphs. Using another characterization, Lov\'asz and Yemini in 1982 showed that every 6-connected graph is rigid. We give two further sufficient connectivity conditions for a graph to be rigid. Our proofs surprisingly involve a discharging argument. This is based on joint work with Xiaofeng Gu, Wei Meng, Martin Rolek, and Yue Wang.
Host: Guantao Chen (gchen@gsu.edu)
0 people are interested in this event