Colloquium on Pure Mathematics

Order trees and infinite graphs

by Dr Max Pitz (Universität Hamburg)

Europe/Berlin
Geom H5

Geom H5

Description

Traditionally, the trees studied in infinite graphs are trees of height at most omega, with each node adjacent to its parent and its children (and every tree branch inducing a path or a ray). However, it  has become apparent over the previous decade that the structure of infinite graphs is in fact much more closely governed by the theory of well-founded order trees. In this talk, I will describe these connections and discuss some of the key results in the field.

Organised by

Dr. Murad Alim