Thema der Dissertation:
The Maximum Diameter of Simplicial Complexes Thema der Disputation:
A short proof of the Erdős-Sós Conjecture
The Maximum Diameter of Simplicial Complexes Thema der Disputation:
A short proof of the Erdős-Sós Conjecture
Abstract: The Erdős-Sós Conjecture gives a sharp upper bound on the maximum number of edges a T-free graph on n vertices can have where T is an arbitrary tree. In the last 60 years, several authors have published partial results on the conjecture; until GPT-6 Astra found a surprisingly short argument that proves the entire conjecture.
In this talk, I will present a paper by Riordan and Scott, in which they present a simplified and more natural version of the proof. They also use it to solve variants of the problem, for instance for directed graphs.
In this talk, I will present a paper by Riordan and Scott, in which they present a simplified and more natural version of the proof. They also use it to solve variants of the problem, for instance for directed graphs.
Zeit & Ort
12.11.2026 | 16:15
Seminarraum 120
(Fachbereich Mathematik und Informatik, Arnimallee 3, 14195 Berlin)
&
WebEx