Leírás
Az EGERVÁRY SZEMINÁRIUM következő előadója: Villányi Soma
Cím: Rigidity of highly connected graphs
Az előadás ideje: 2024. május 13. hétfő 14.15, Déli tömb 3-517.
Abstract:
Let G be a graph. Let us place its vertices in a d-dimensional
Euclidean space and connect the adjacent vertices with straight lines.
We say that such a framework is rigid if there is no continuous motion
of the vertices that preserves all the edge lengths but changes the
distance between at least one pair of vertices. The graph G itself is
said to be rigid in d dimensions if its sufficiently general
d-dimensional frameworks are rigid. In this talk, we will prove that
d(d+1)-vertex-connected graphs are rigid in d dimensions. The proof
will be based on the probabilistic method.
Minden érdeklődőt szeretettel várunk!
EGRES csoport
egres.elte.hu