Personal tools
You are here: Home CG seminar 2019 Every embedding of a dense graph has a rigid subset
« August 2019 »
August
SuMoTuWeThFrSa
123
45678910
11121314151617
18192021222324
25262728293031
Log in


Forgot your password?
 

Every embedding of a dense graph has a rigid subset

Wednesday, April 10th, 2019, 16:10

Schreiber 309

underline

Every embedding of a dense graph has a rigid subset

Orit Raz, UBC

Abstract:

While the problem of determining whether an embedding of a graph G in R^2 is  infinitesimally rigid is well understood, specifying whether a given embedding of G is rigid or not is still a hard task that usually requires ad hoc arguments. 

In the talk I will discuss a recent result (joint with Jozsef Solymosi), where we show that every embedding of a sufficiently dense graph has a rigid subset. The proof uses a reduction of the original rigidity problem to a question about line configurations in R^3.

 

Document Actions