The maximum diameter of $d$-dimensional simplicial complexes

Abstract

For every fixed dimension $d$ and sufficiently large $n$, we determine the maximum possible diameter of a strongly connected $d$-dimensional simplicial complex on $n$ vertices. This improves on a sequence of previous results and settles a problem of Santos from 2013. On the way, as a special case, we also characterise the existence of an extra-tight Euler tour in the complete $d$-uniform hypergraph on $n$ vertices.