Leírás
Kedves Kombinatorikusok!
Május 9-én (14:15, Rényi Nagyterem) a következő Kombinatorika Szemináriumon
Jordán Tibor (ELTE, Eötvös Loránd University and the HUN-REN-ELTE
Egerváry Research Group on Combinatorial Optimization)
ad elő
Highly connected orientations and removable spanning trees
with the help of graph rigidity
címmel
Abstract: In this talk I will present the main ideas behind the
solutions of some long standing conjectures in graph connectivity: a
conjecture of Lovász and Yemini on rigidity properties of highly connected graphs
(1982), a conjecture of Thomassen on highly connected orientations of graphs
(1985), a conjecture of Kriesell on spanning trees whose edge set can be
deleted preserving high connectivity (2003), and more.
The talk is based on three recent papers, authored by (different
subsets of)
D. Garamvölgyi, Cs. Király, S. Villányi, and the speaker.
Zoom:
https://zoom.us/j/2961946869