Thema der Dissertation:
Flips & Partitions in Geometric Graphs Thema der Disputation:
Graph Decomposition - A proof of Ringel's Conjecture
Flips & Partitions in Geometric Graphs Thema der Disputation:
Graph Decomposition - A proof of Ringel's Conjecture
Abstract: Decomposing graphs into smaller subgraphs is a classical problem with a long and rich history and many appealing results and conjectures. One of the most outstanding conjecture from the field is Ringel's conjecture (1963), stating that the complete graph $K_{2n+1}$ on (2n+1) vertices can be decomposed into copies of every tree on $n$ edges for every $n \in \mathbb{N}$. The main result presented in this talk is a recent proof of Ringel's conjecture (for sufficiently large $n$) by Montgomery, Pokrovskiy, and Sudakov.
Zeit & Ort
10.11.2023 | 10:15
Seminarraum 031
(Fachbereich Mathematik und Informatik, Arnimallee 7, 14195 Berlin)