Description
Az EGERVÁRY SZEMINÁRIUM következő előadója: Garamvölgyi Dániel
Cím: Rigidity and reconstruction in matroids of highly connected graphs
Az előadás ideje: 2024. október 7. hétfő 14.15, Déli tömb 3-517.
Abstract:
The talk will be about analogues of the following pair of classic results:
- a consequence of a theorem of Whitney, which says that every
3-connected graph is determined (up to isomorphism) by its graphic
matroid
- a theorem of Lovász and Yemini, which says that every 6-connected
graph is generically rigid in the plane.
I will show that for a surprisingly general class of matroids defined
on edge sets of graphs, if we have a Lovász-Yemini type "rigidity"
result, then we can use it to deduce a Whitney-type
"reconstructibility" result. This recovers and extends all known
Whitney-type results.
Minden érdeklődőt szeretettel várunk!
EGRES csoport
egres.elte.hu