Speaker
Alice Contat
(University Paris-Saclay)
Description
Consider a tree with n vertices and let $m \geq n$ cars arrive on its vertices. Each car tries to park on its arrival node, and if the spot is already occupied, it drives towards the root of the tree and park as soon as possible. When at the end, all spots are occupied we call the resulting tree a fully parked tree. In this talk, I will describe a new method to enumerate maps that is inspired from Lackner—Panholzer "last car decomposition" of fully parked trees.
